On the use of registers vs. cache to minimize memory traffic
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
On the Minimization of Loads/Stores in Local Register Allocation
IEEE Transactions on Software Engineering
Optimal local register allocation for a multiple-issue machine
ICS '94 Proceedings of the 8th international conference on Supercomputing
Optimal register assignment to loops for embedded code generation
ISSS '95 Proceedings of the 8th international symposium on System synthesis
Memory bandwidth limitations of future microprocessors
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Optimal register assignment to loops for embedded code generation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Investigating optimal local memory performance
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Dual-issue scheduling with spills for binary trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Code Generation for Expressions with Common Subexpressions
Journal of the ACM (JACM)
Look-ahead allocation in the presence of branches
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Register allocation via usage counts
Communications of the ACM
The mobile programming system: STAGE2
Communications of the ACM
Communications of the ACM
A comment on index register allocation
Communications of the ACM
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Global array reference allocation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A Method for Register Allocation to Loops in Multiple Register File Architectures
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Array Reference Allocation Using SSA-Form and Live Range Growth
LCTES '00 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Complete register allocation problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Validating register allocations for straight line programs
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
A survey of compiler optimization techniques
ACM '73 Proceedings of the ACM annual conference
Code generation for expressions with common subexpressions (Extended Abstract)
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A technological review of the FORTRAN I compiler
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Compiler assignment of data items to registers
IBM Systems Journal
On-line measurement of paging behavior by the multivalued MIN algorithm
IBM Journal of Research and Development
The history of language processor technology in IBM
IBM Journal of Research and Development
Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
Finding shuffle words that represent optimal scheduling of shared memory access
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Manipulating MAXLIVE for spill-free register allocation
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
| Hi-index | 0.08 |
A procedure for index register allocation is described. The rules of this procedure are shown to yield an optimal allocation for “straight line” programs.