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...
Saved in:
| Published in: | Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture pp. 150 - 159 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding Journal Article |
| Language: | English |
| Published: |
Washington, DC, USA
IEEE Computer Society
01.01.2001
|
| Series: | ACM Conferences |
| Subjects: |
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 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

