๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dynamic programming for computer register allocation

โœ Scribed by William W. Agresti

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
869 KB
Volume
4
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Register Allocation in Structured Progra
Register Allocation in Structured Programs
โœ Sampath Kannan; Todd Proebsting ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

In this article we look at the register allocation problem. In the literature this problem is frequently reduced to the general graph coloring problem and the solutions to the problem are obtained from graph coloring heuristics. Hence, no algorithm with a good performance guarantee is known. Here we

Using integer linear programming for ins
Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
โœ Chia-Ming Chang; Chien-Ming Chen; Chung-Ta King ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 752 KB

Instruction scheduling and register allocation are two very important optimizations in modern compilers for advanced processors. These two optimizations must be performed simultaneously in order to maximize the instruction-level parallelism and to fully utilize the registers [1]. In this paper, we s

An approximation algorithm for the regis
An approximation algorithm for the register allocation problem
โœ K. Jansen; J. Reiter ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can