Generalizations of the sethi‐ullman algorithm for register allocation

Andrew W. Appel, Kenneth J. Supowit

Research output: Contribution to journalArticle

10 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 languageEnglish (US)
Pages (from-to)417-421
Number of pages5
JournalSoftware: Practice and Experience
Volume17
Issue number6
DOIs
StatePublished - Jun 1987

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Code generation
  • Code optimization
  • Expression trees
  • Register allocation

Fingerprint Dive into the research topics of 'Generalizations of the sethi‐ullman algorithm for register allocation'. Together they form a unique fingerprint.

  • Cite this