Thumbnail
Access Restriction
Subscribed

Author Freiburghouse, R. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Demand paging ♦ Virtual memory ♦ Common subexpressions ♦ Redundant computations ♦ Optimization ♦ Programming languages ♦ Register allocation ♦ Compilers
Abstract This paper introduces the notion of usage counts, shows how usage counts can be developed by algorithms that eliminate redundant computations, and describes how usage counts can provide the basis for register allocation. The paper compares register allocation based on usage counts to other commonly used register allocation techniques, and presents evidence which shows that the usage count technique is significantly better than these other techniques.
Description Affiliation: Honeywell Information Systems Inc., Cambridge, MA (Freiburghouse, R. A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 11
Page Count 5
Starting Page 638
Ending Page 642


Open content in new tab

   Open content in new tab
Source: ACM Digital Library