Iterative modulo scheduling
B. Ramakrishna Rau · 1994
Modulo scheduling is a framework within which a wide variety of algorithms and heuristics may be defined for software pipelining innermost loops. This paper presents a practical algorithm, iterative modulo scheduling, that is capable of dealing with realistic machine models. This paper also characterizes the algorithm in terms of the quality of the generated schedules as well the computational expense incurred.
Cited by 711 works. doi:10.1145/192724.192731 Open-access PDF
Authors
References
- The Design and Analysis of Computer Algorithms
- Combinatorial optimization: networks and matroids
- Parallel Sequencing and Assembly Line Problems
- Trace Scheduling: A Technique for Global Microcode Compaction
- A comparison of list schedules for parallel processing systems
- Software pipelining
- Conversion of control dependence to data dependence
- The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
- The superblock: An effective technique for VLIW and superscalar compilation
- Highly concurrent scalar processing