Heuristic chaining in directed acyclic graphs

Authors:
R. Venugopal;Y. N. Srikant
Affiliations:
Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India;Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India
Venue:
Computer Languages
Year:
1993

Citing 8
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Optimal Chaining in Expression Trees

IEEE Transactions on Computers
Scheduling arithmetic and load operations in parallel with no spilling

SIAM Journal on Computing
Optimal Code Generation for Expression Trees

Journal of the ACM (JACM)
Code Generation for Expressions with Common Subexpressions

Journal of the ACM (JACM)
Register allocation via usage counts

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Optimal Instruction-Scheduling Model for a Class of Vector Processors

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we look at the problem of generating code with instruction chaining from directed acyclic graphs (DAGs). The problem is shown to be NP-complete. A simple heuristic for the problem is devised and its performance is compared with existing methods. The heuristic is shown to generate good code especially when the number of registers is large. Also described is an extension to the heuristic which improves the code for a small number of registers.