Generating optimal contiguous evaluations for expression DAGs

Authors:
Christoph W. Keβler;Thomas Rauber
Affiliations:
Computer Science Department, Universität des Saarlandes, Postfach 151150, 66041 Saarbrücken, Germany;Computer Science Department, Universität des Saarlandes, Postfach 151150, 66041 Saarbrücken, Germany
Venue:
Computer Languages
Year:
1995

Citing 7
Cited 1

Code scheduling and register allocation in large basic blocks

ICS '88 Proceedings of the 2nd international conference on Supercomputing
The Generation of Optimal Code for Arithmetic Expressions

Journal of the ACM (JACM)
Optimal Code Generation for Expression Trees

Journal of the ACM (JACM)
A Randomized Heuristic Approach to Register Allocation

PLILP '91 Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Trace Scheduling: A Technique for Global Microcode Compaction

IEEE Transactions on Computers
Register allocation via coloring

Computer Languages

Scheduling expression DAGs for minimal register need

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the NP-complete problem of generating contiguous evaluations for expression DAGs with a minimal number of registers. We present two algorithms that generate optimal contiguous evaluation for a given DAG. The first is a modification of a complete search algorithm that omits the generation of redundant evaluations. The second algorithm generates only the most promising evaluations by splitting the DAG into trees with import and export nodes and evaluating the trees with a modified labeling scheme. Experiments with randomly generated DAGs and large DAGs from real application programs confirm that the new algorithms generate optimal contiguous evaluations quite fast.