Citation Context

...8 128 0.00 128 fftf 128 128 0.00 128 radf5 123 132 -7.32 96 radb5 123 118 4.07 82 putb 43 44 -2.33 38 getb 26 22 15.38 20 rfftil 24 19 20.83 20 slv2xy 11 9 18.18 11 pdiag 6 0 100.00 6 transformations =-=[10, 6, 14]-=-. As these techniques become more widely applied, compilers will need to deal with their consequences. For this study, we focused on routines from the program wave5 in the SPEC95 benchmark suite. Thes...

Citation Context

...ooper 1 and L. Taylor Simpson 2 1 Rice University, Houston, Texas, USA 2 Trilogy Development Group, Austin, Texas, USA Abstract. 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 sharing a register. Nodes in 2: represent live ranges. An edge between two nodes indicates that they...

Citation Context

...tine are renamed to create live ranges. A live range is a collection of definitions that reach a common use. Briggs accomplishes this by converting the routine to pruned static single assignment form =-=[12]-=- and then combining all names mentioned in each C-node. Build The interference graph, Z, contains a node for each live range and an edge between each pair of live ranges that are simultaneously live. ...

Citation Context

...ooper 1 and L. Taylor Simpson 2 1 Rice University, Houston, Texas, USA 2 Trilogy Development Group, Austin, Texas, USA Abstract. 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 sharing a register. Nodes in 2: represent live ranges. An edge between two nodes indicates that they...

Citation Context

...se maximal-length live ranges as the basic unit of allocation. It has long been recognized that breaking a live range into smaller pieces may allow some, or all, of the resulting pieces to be colored =-=[13, 9]-=-. Chow used this observation in his priority-based coloring scheme; when his allocator encountered a live range that could not be kept in a register, it broke it into smaller pieces. Briggs experiment...

Citation Context

...s on the coloring heuristic that increase the number of live ranges that can be colored [4, 5]. Bernstein et al. showed that different heuristics for choosing spill candidates can improve the results =-=[2]-=-. These modifications have reduced the cost of spilling, but they have not eliminated it. The remaining problem is not a poor coloring heuristic; these routines have regions where they need more regis...

Citation Context

...ooper 1 and L. Taylor Simpson 2 1 Rice University, Houston, Texas, USA 2 Trilogy Development Group, Austin, Texas, USA Abstract. 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 sharing a register. Nodes in 2: represent live ranges. An edge between two nodes indicates that they...

Citation Context

...8 128 0.00 128 fftf 128 128 0.00 128 radf5 123 132 -7.32 96 radb5 123 118 4.07 82 putb 43 44 -2.33 38 getb 26 22 15.38 20 rfftil 24 19 20.83 20 slv2xy 11 9 18.18 11 pdiag 6 0 100.00 6 transformations =-=[10, 6, 14]-=-. As these techniques become more widely applied, compilers will need to deal with their consequences. For this study, we focused on routines from the program wave5 in the SPEC95 benchmark suite. Thes...

Citation Context

...it matrix may be space inefficient for C. A recent study of techniques for building interference graphs showed that a closed hash table implementation can use less space for sufficiently large graphs =-=[11]-=-. C should reach that threshold in half the time. These suggestions should reduce the space impact of building C rather than 27.180 Fig. 4, Building the containment graph buildContainmentGraph () All...

Citation Context

...it into smaller pieces. We are not the first to study this problem. Bergner et M. describe a heuristic called interference region spilling that reduces the amount of code needed to spill a live range =-=[1]-=-. Briggs experimented with an aggressive form of live range splitting; he saw mixed results [3, see Chapter 6]. This paper presents a passive form of live range splitting that uses splitting as an alt...

Citation Context

...8 128 0.00 128 fftf 128 128 0.00 128 radf5 123 132 -7.32 96 radb5 123 118 4.07 82 putb 43 44 -2.33 38 getb 26 22 15.38 20 rfftil 24 19 20.83 20 slv2xy 11 9 18.18 11 pdiag 6 0 100.00 6 transformations =-=[10, 6, 14]-=-. As these techniques become more widely applied, compilers will need to deal with their consequences. For this study, we focused on routines from the program wave5 in the SPEC95 benchmark suite. Thes...

Citation Context

...se maximal-length live ranges as the basic unit of allocation. It has long been recognized that breaking a live range into smaller pieces may allow some, or all, of the resulting pieces to be colored =-=[13, 9]-=-. Chow used this observation in his priority-based coloring scheme; when his allocator encountered a live range that could not be kept in a register, it broke it into smaller pieces. Briggs experiment...