Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Generalizations of the SethiUllman algorithm for register allocation Andrew W. Appel
 

Summary: Generalizations of the Sethi­Ullman algorithm for register allocation
Andrew W. Appel
Kenneth J. Supowit+
Department of Computer Science
Princeton University
Princeton, NJ 08544
March 31, 1986
revised Sept 24, 1986
ABSTRACT
The Sethi­Ullman algorithm for register allocation finds an optimal ordering of a
computation tree. Two simple generalizations of the algorithm increase its applicability
without significantly increasing its cost.
Keywords: Register allocation, Code generation, Code optimization, Expression
trees
Introduction
Certain computations can be appropriately modelled as computation trees. A computation tree has con­
stant values as its leaves, and the internal nodes are given values inductively as specified arithmetic func­
tions of the values of their children. For example, the computation tree for the expression
(3 + (4 + 3) ×(5 + 6)) is
+

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences