Exploiting pseudo-schedules to guide data dependence graph partitioning
Alex Aletà, Josep Maria Codina, F.J. Alejandre Sánchez, Antonio M. González, David R Kaeli · 2002
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.