Lifetime-sensitive modulo scheduling
Richard A. Huff · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1993
This paper shows how to software pipeline a loop for minimal register pressure without sacrificing the loop's minimum execution time. This novel bidirectional slack-scheduling method has been implemented in a FORTRAN compiler and tested on many scientific benchmarks. The empirical results—when measured against an absolute lower bound on execution time, and against a novel schedule-independent absolute lower bound on register pressure—indicate near-optimal performance.
Cited by 237 works. doi:10.1145/155090.155115
Authors
References
- Combinatorial optimization: networks and matroids
- A data locality optimizing algorithm
- Conversion of control dependence to data dependence
- An efficient method of computing static single assignment form
- The multiflow trace scheduling compiler
- Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing
- The Cydra 5 departmental supercomputer: design philosophies, decisions, and trade-offs
- Local Microcode Compaction Techniques
- An efficient search algorithm to find the elementary circuits of a graph
- A Systolic Array Optimizing Compiler