|
Volumn , Issue , 2002, Pages 130-138
|
Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms
|
Author keywords
And maximum spanning tree; Compiler; Dual memory; Graph coloring; Memory assignment; Non orthogonal architecture
|
Indexed keywords
ALGORITHMS;
COMPUTER ARCHITECTURE;
STORAGE ALLOCATION (COMPUTER);
TREES (MATHEMATICS);
GENERAL-PURPOSE PROCESSORS (GPP);
PROGRAM PROCESSORS;
|
EID: 0036977327
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/513852.513853 Document Type: Conference Paper |
Times cited : (23)
|
References (15)
|