Exploiting pseudo-schedules to guide data dependence graph partitioning
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
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 4-cluster VLIW architecture with 32 registers and a 2-cycle inter-cluster communication delay we obtain an average speedup of 38.5%.
CitationAleta, A., Codina, J.M., Sánchez, F., González, A., David, K. Exploiting pseudo-schedules to guide data dependence graph partitioning. A: International Conference on Parallel Architectues and Compilation Techniques. "2002 International Conference on Parallel Architectures and Compilation Techniques, PACT 2002: 22-25 September 2002, Charlottesville, Virginia, USA: proceedings". Charlottesville, Virginia: Institute of Electrical and Electronics Engineers (IEEE), 2002, p. 281-290.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder