Thumbnail
Access Restriction
Subscribed

Author Kwon, Young-Jun ♦ Zhang, Yukong ♦ Lee, Hyuk Jae
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract A register-reuse chain is a set of nodes assigned to the same register. This paper proposes a systematic technique to generate register-reuse chains while aiming to reduce unnecessary dependencies. To avoid any dependency, the first phase of the proposed technique assigns two nodes to the same chain, only if the two nodes do not overlap their live ranges by any possible schedule. To reduce the number of chains, the second phase merges chains by assigning a node and one of its dependent nodes to the same chain. Evaluation shows that the proposed technique reduces dependencies by an average of 20.9%.
Description Affiliation: Intel Corporation Santa Clara, CA (Kwon, Young-Jun) || DMR Consulting Group, Inc. Dallas, TX (Zhang, Yukong) || Intel Corporation Hillsboro, OR (Lee, Hyuk Jae)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 36
Issue Number 2
Page Count 8
Starting Page 47
Ending Page 54


Open content in new tab

   Open content in new tab
Source: ACM Digital Library