Lifetime-sensitive modulo scheduling
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
The meeting graph: a new model for loop cyclic register allocation
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
A Register Allocation Framework Based on Hierarchical Cyclic Interval Graphs
CC '92 Proceedings of the 4th International Conference on Compiler Construction
Handling Cross Interferences by Cyclic Cache Line Coloring
PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
| Hi-index | 0.00 |
We show that cyclic graph coloring techniques from loop register allocation are successfully applicable to caches. Values of one color belong together, even if they stem from different data structures, resulting in a sytematic merging.