12 search results - page 1 / 3 » A Randomized Heuristic Approach to Register Allocation |
PLILP
1991
Springer
13 years 9 months ago
1991
Springer
ASPDAC
1995
ACM
13 years 9 months ago
1995
ACM
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...
DAC
1995
ACM
13 years 9 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
CC
1998
Springer
13 years 5 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
IEEEPACT
1998
IEEE
13 years 9 months ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...