Iterative Modulo Scheduling: An Algorithm For Software Pipelining Loops
B. Ramakrishna Rau
rau@hplbrr.hpl.hp.com
Abstract
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 as the
computational expense incurred.
Talk
Overheads (0 bytes)