92 search results - page 7 / 19 » Optimal versus Heuristic Global Code Scheduling |
101
click to vote
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
ASPDAC
2000
ACM
15 years 2 months ago
2000
ACM
Symbolic debuggers are system development tools that can accelerate the validation speed of behavioral specifications by allowing a user to interact with an executing code at the ...
85
Voted
HEURISTICS
2006
14 years 9 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
ICS
1995
Tsinghua U.
15 years 1 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
82
Voted
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...