Generalizations of the sethi‐ullman algorithm for register allocation

Andrew W. Appel; Kenneth J. Supowit

doi:10.1002/spe.4380170607

Generalizations of the sethi‐ullman algorithm for register allocation

Andrew W. Appel, Kenneth J. Supowit

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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.

Original language	English (US)
Pages (from-to)	417-421
Number of pages	5
Journal	Software: Practice and Experience
Volume	17
Issue number	6
DOIs	https://doi.org/10.1002/spe.4380170607
State	Published - Jun 1987

All Science Journal Classification (ASJC) codes

Software

Keywords

Code generation
Code optimization
Expression trees
Register allocation

Access to Document

10.1002/spe.4380170607

Cite this

@article{7fc04f7f1ba648e4b7365f0e22f9732b,

title = "Generalizations of the sethi‐ullman algorithm for register allocation",

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 = "Code generation, Code optimization, Expression trees, Register allocation",

author = "Appel, \{Andrew W.\} and Supowit, \{Kenneth J.\}",

year = "1987",

month = jun,

doi = "10.1002/spe.4380170607",

language = "English (US)",

volume = "17",

pages = "417--421",

journal = "Software: Practice and Experience",

issn = "0038-0644",

publisher = "John Wiley and Sons Ltd",

number = "6",

}

TY - JOUR

T1 - Generalizations of the sethi‐ullman algorithm for register allocation

AU - Appel, Andrew W.

AU - Supowit, Kenneth J.

PY - 1987/6

Y1 - 1987/6

N2 - 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.

AB - 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.

KW - Code generation

KW - Code optimization

KW - Expression trees

KW - Register allocation

UR - https://www.scopus.com/pages/publications/0023366174

UR - https://www.scopus.com/inward/citedby.url?scp=0023366174&partnerID=8YFLogxK

U2 - 10.1002/spe.4380170607

DO - 10.1002/spe.4380170607

M3 - Article

AN - SCOPUS:0023366174

SN - 0038-0644

VL - 17

SP - 417

EP - 421

JO - Software: Practice and Experience

JF - Software: Practice and Experience

IS - 6

ER -

Generalizations of the sethi‐ullman algorithm for register allocation

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this