TY - GEN
T1 - The benefit of predicated execution for software pipelining
AU - Warter, Nancy J.
AU - Lavery, Daniel Ri
AU - Hwu, Wen Mei W.
N1 - Funding Information:
This research has been supported by the Joint Services Engineering Programs (JSEP) under Contract N00014-90-J-1270, Dr. Lee Hoevel at NCR, the AMD 29K Advanced Processor Development Division, Mat-sushita Electric Industrial Corporation Ltd., Hewlett-Packard, and the National Aeronautics and Space Administration (NASA) under Contract NASA NAG 1- 613 in cooperation with the Illinois Computer Laboratory for Aerospace Systems and Software (ICLASS).
Funding Information:
This research has been supported by the Joint Services Engineering Programs (JSEP) under Contract N00014-90-J-1270, Dr. Lee Hoevel at NCR, the AMD 29K Advanced Processor Development Division, Matsushita Electric Industrial Corporation Ltd., Hewlett-Packard, and the National Aeronautics and Space Administration (NASA) under Contract NASA NAG 1-613 in cooperation with the Illinois Computer Laboratory for Aerospace Systems and Software (ICLASS).
Publisher Copyright:
© 1993 IEEE.
PY - 1993
Y1 - 1993
N2 - An empirical study of the importance of an architectural support, referred to as predicted execution, for the effectiveness of software pipelining is presented. In particular, the analysis is designed to help future microprocessor designers to determine whether predicated execution support is worthwhile given their own estimation of the increased hardware cost. To perform an in-depth analysis, the authors focus on Rau's modulo scheduling algorithm for software pipelining. Three versions of the modulo scheduling algorithm, one with and two without predicated execution support, were implemented in a prototype compiler. Experiments based on important loops from numeric applications showed that predicated execution support substantially improved the effectiveness of the modulo scheduling algorithm.
AB - An empirical study of the importance of an architectural support, referred to as predicted execution, for the effectiveness of software pipelining is presented. In particular, the analysis is designed to help future microprocessor designers to determine whether predicated execution support is worthwhile given their own estimation of the increased hardware cost. To perform an in-depth analysis, the authors focus on Rau's modulo scheduling algorithm for software pipelining. Three versions of the modulo scheduling algorithm, one with and two without predicated execution support, were implemented in a prototype compiler. Experiments based on important loops from numeric applications showed that predicated execution support substantially improved the effectiveness of the modulo scheduling algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84976838747&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84976838747&partnerID=8YFLogxK
U2 - 10.1109/HICSS.1993.283949
DO - 10.1109/HICSS.1993.283949
M3 - Conference contribution
AN - SCOPUS:84976838747
T3 - Proceedings of the Annual Hawaii International Conference on System Sciences
SP - 497
EP - 506
BT - Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993
PB - IEEE Computer Society
T2 - 26th Hawaii International Conference on System Sciences, HICSS 1993
Y2 - 8 January 1993
ER -