Minimum Register Allocation is Complete in Polynomial Space

Thumbnail Image
Download
Name

MIT-LCS-TM-128.pdf

Size

3.64 MB

Format

Adobe PDF

Checksum (MD5)

753b95c589804e30b6e1eea53f04c78b

Author(s)
Loui, Michael C.
Date Issued
March 1979
Series/Report no.
MIT-LCS-TM-128
Abstract
The Minimum Register Allocation Problem is to determine the minimum number of registers required to evaluate an arithmetic expression. A pebble game on directed acyclic graphs is used to prove that this is complete is complete in polynomial space.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.