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

Register assignment in tree-structured programs

โœ Scribed by William W. Agresti

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
736 KB
Volume
18
Category
Article
ISSN
0020-0255

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

A Semi-Automatic Multiple-Strategy Appro
A Semi-Automatic Multiple-Strategy Approach To Mapping Tree-Structured Symbolic Processing Programs
โœ ANGELA SODAN ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 615 KB

Symbolic applications such as expert systems, theorem provers, and computer algebra exhibit dynamic, tree-structured behavior with respect to control and data structures. This is why it is difficult to parallelize a program and get it running efficiently on a parallel computer, especially one with d

Generalized structured programs and loop
Generalized structured programs and loop trees
โœ Ward Douglas Maurer ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 440 KB

Any directed graph, even a flow graph representing "spaghetti code", is shown here to have at least one loop tree, which is a structure of loops within loops in which no loops overlap. The nodes of the graph may be rearranged in such a way that, with respect to their new order, every edge proceeds i