By Topic

Flexible dependence and software pipelining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rong Hong-Bo ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Tang Zhi-Zhong

Software pipelining is an effective approach to loop scheduling. A common problem is that, if some paths are severely constrained by dependence cycles while others are not, how to find an optimal schedule without splitting paths. By removing control dependencies, speculation provides a general but limited answer. This paper provides another answer: removing data dependencies. Although a data dependency is a must-follow relationship, that does not mean it always has instances. By data dependence relaxation, a (near) optimal schedule with self-adaptable initiation interval is achieved.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:1 )

Date of Conference:

14-17 May 2000