Skip to search formSkip to main contentSkip to account menu

Register allocation

Known as: Register allocator, Register spill, Live range 
In compiler optimization, register allocation is the process of assigning a large number of target program variables onto a small number of CPU… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
A variety of new register file architectures have been developed for embedded processors in recent years, promoting hardware… 
2001
2001
One important problem in code generation for embedded processors is the design of efficient compilers for target machines with… 
2000
2000
Instruction-level parallelism (ILP) refers to a family of processor and compiler design techniques that speed up execution by… 
1996
1996
Modern processors use memory hierarchy of several levels. Achieving high performance mandates the effective use of the cache… 
1994
1994
This paper analyses the register requirements of software pipelined inner loops. When the number of functional units and/or the… 
1993
1993
A performance bounding methodology that explains the performance of loop-dominated scientific applications on particular systems… 
1991
1991
The register allocation can be considered as a graph coloring problem.Every node in the graph stands for candidates of the… 
1988
1988
MIMOSA is an experimental software for the automatic generation and optimization of microcode for horizontal microprogrammed… 
1982
1982
The Bell Labs C Machine project is investigating computer architectures to support the C programming language.1 One of the goals… 
Review
1976
Review
1976
This paper describes a new technique for designing high level machine independent microprogramming languages. In Section 1.0 we…