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 | |
| State | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver