Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
271
Linear Scan Register Allocation
- ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1999
"... ..."
Improvements to Linear Scan register allocation 1 Abstract
, 2004
"... Linear scan register allocation is a fast global register allocation first presented in [PS99] as an alternative to the more widely used graph coloring approach. In this paper, I apply the linear scan register allocation algorithm in a system with SSA form and show how to improve the algorithm by ta ..."
Abstract
- Add to MetaCart
Linear scan register allocation is a fast global register allocation first presented in [PS99] as an alternative to the more widely used graph coloring approach. In this paper, I apply the linear scan register allocation algorithm in a system with SSA form and show how to improve the algorithm
Linear Scan Register Allocation in the HiPE Compiler
, 2001
"... We describe and evaluate the linear scan register allocator proposed by Poletto and Sarkar, and extensively report on its implementation and behaviour in the context of a native code compiler for the concurrent functional programming language Erlang. We also investigate how dierent options of th ..."
Abstract
- Add to MetaCart
We describe and evaluate the linear scan register allocator proposed by Poletto and Sarkar, and extensively report on its implementation and behaviour in the context of a native code compiler for the concurrent functional programming language Erlang. We also investigate how dierent options
Linear scan register allocation on ssa form
- In Proceedings of the International Symposium on Code Generation and Optimization
, 2010
"... The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Although most of these compilers use static single assignment (SSA) form, the algorithm has not yet been applied on SSA form, ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Although most of these compilers use static single assignment (SSA) form, the algorithm has not yet been applied on SSA form
Abstract Quality and Speed in Linear-scan Register Allocation
"... A linear-scan algorithm directs the global allocation of reg-ister candidates to registers based on a simple linear sweep over the program being compiled. This approach to register allocation makes sense for systems, such as those for dynamic compilation, where compilation speed is impor-tant. In co ..."
Abstract
- Add to MetaCart
A linear-scan algorithm directs the global allocation of reg-ister candidates to registers based on a simple linear sweep over the program being compiled. This approach to register allocation makes sense for systems, such as those for dynamic compilation, where compilation speed is impor
Optimized interval splitting in a linear scan register allocator
- In 1st ACM/USENIX International Conference on Virtual Execution Environments (VEE
, 2005
"... We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems ’ Java HotSpot TM client compiler. Linear scan register allocation is especially suitable for just-in-time compilers because it is faster than the common graph-coloring approach and yields re ..."
Abstract
-
Cited by 32 (13 self)
- Add to MetaCart
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems ’ Java HotSpot TM client compiler. Linear scan register allocation is especially suitable for just-in-time compilers because it is faster than the common graph-coloring approach and yields
ABSTRACT Optimized Interval Splitting in a Linear Scan Register Allocator ∗
"... We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems ’ Java HotSpot TM client compiler. Linear scan register allocation is especially suitable for just-in-time compilers because it is faster than the common graph-coloring approach and yields re ..."
Abstract
- Add to MetaCart
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems ’ Java HotSpot TM client compiler. Linear scan register allocation is especially suitable for just-in-time compilers because it is faster than the common graph-coloring approach and yields
Cooperative instruction scheduling with linear scan
, 2005
"... Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear scan register allocation yields poorer code than allocation schemes based on graph coloring. In this paper, we propose a pre-pass ..."
Abstract
- Add to MetaCart
Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear scan register allocation yields poorer code than allocation schemes based on graph coloring. In this paper, we propose a pre
Results 1 - 10
of
271
