Graph-partitioning based instruction scheduling for clustered processors
This work presents a novel scheme to schedule loops for clustered microarchitectures. The scheme is based on a preliminary cluster assignment phase implemented through graph partitioning techniques followed by a scheduling phase that integrates register allocation and spill code generation. The grap...
Uložené v:
| Vydané v: | Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture s. 150 - 159 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Konferenčný príspevok.. Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Washington, DC, USA
IEEE Computer Society
01.01.2001
|
| Edícia: | ACM Conferences |
| Predmet: |
Theory of computation
> Design and analysis of algorithms
> Approximation algorithms analysis
> Scheduling algorithms
Theory of computation
> Design and analysis of algorithms
> Online algorithms
> Online learning algorithms
Theory of computation
> Design and analysis of algorithms
> Online algorithms
> Online learning algorithms
> Scheduling algorithms
|
| ISBN: | 0769513697, 9780769513690 |
| ISSN: | 1072-4451 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!

