Virtual cluster scheduling through the scheduling graph
Visualitza/Obre
Cita com:
hdl:2117/102480
Tipus de documentText en actes de congrés
Data publicació2007
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
This paper presents an instruction scheduling and cluster assignment approach for clustered processors. The proposed technique makes use of a novel representation named the scheduling graph which describes all possible schedules. A powerful deduction process is applied to this graph, reducing at each step the set of possible schedules. In contrast to traditional list scheduling techniques, the proposed scheme tries to establish relations among instructions rather than assigning each instruction to a particular cycle. The main advantage is that wrong or poor schedules can be anticipated and discarded earlier. In addition, cluster assignment of instructions is performed using another novel concept called virtual clusters, which define sets of instructions that must execute in the same cluster. These clusters are managed during the deduction process to identify incompatibilities among instructions. The mapping of virtual to physical clusters is postponed until the scheduling of the instructions has finalized. The advantages this novel approach features include: (1) accurate scheduling information when assigning, and, (2) accurate information of the cluster assignment constraints imposed by scheduling decisions. We have implemented and evaluated the proposed scheme with superblocks extracted from Speclnt95 and MediaBench. The results show that this approach produces better schedules than the previous state-of-the-art. Speed-ups are up to 15%, with average speed-ups ranging from 2.5% (2-Clusters) to 9.5% (4-Clusters).
CitacióCodina, J.M., Sánchez, J., González, A. Virtual cluster scheduling through the scheduling graph. A: International Symposium on Code Generation and Optimization. "International Symposium on Code Generation and Optimization, CGO 2007: 11-14 March 2007, San Jose, California". San Jose, CA: Institute of Electrical and Electronics Engineers (IEEE), 2007, p. 89-101.
ISBN978-0-7695-2764-2
Versió de l'editorhttp://ieeexplore.ieee.org/document/4145107/
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
04145107.pdf | 248,7Kb | Visualitza/Obre |