The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2002)
Charlottesville, Virginia
Sept. 22, 2002 to Sept. 25, 2002
ISSN: 1089-795X
ISBN: 0-7695-1620-3
pp: 281
Jesús Sánchez , UPC and Intel Barcelona Research Center
Antonio González , UPC and Intel Barcelona Research Center
David Kaeli , Northeastern University
ABSTRACT
<p>This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters is done by means of graph partitioning algorithms that are guided by a pseudo-scheduler. This pseudo-scheduler is a simplified version of the full instruction scheduler and estimates key constraints that would be encountered in the final schedule.</p> <p>The final scheduling process is bi-directional and includes on-the-fly spill code generation. The proposed scheme is evaluated against previous scheduling approaches using the SPECfp95 benchmark suite. Our modeling results show that better schedules are obtained for most programs across a range of different architectures. For a 4-cluster VLIW architecture with 32 registers and a 2-cycle inter-cluster communication delay we obtain an average speedup of 38.5%.</p>
INDEX TERMS
null
CITATION
Jesús Sánchez, Alex Aletà, Antonio González, Josep M. Codina, David Kaeli, "Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 281, 2002, doi:10.1109/PACT.2002.1106027
247 ms
(Ver 3.3 (11022016))