Sciweavers

30
Voted
IEEEPACT
2002
IEEE

Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning

14 years 3 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
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. 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 4cluster VLIW architecture with 32 registers and a 2-cycle inter-cluster communication delay we obtain an average speedup of 38.5%.
Alex Aletà, Josep M. Codina, F. Jesú
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where IEEEPACT
Authors Alex Aletà, Josep M. Codina, F. Jesús Sánchez, Antonio González, David R. Kaeli
Comments (0)