By Topic

Static scheduling of uniform nested loops

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
$31 $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)
Chao, L.-F. ; Dept. of Comput. Sci., Princeton Univ., NJ, USA ; Sha, E.H.-M.

Efficient scheduling of nested loops is an important problem in highly parallel systems. Most of previous research has been on the transformations of iteration space instead of the loop body. The authors introduce a methodology to transform a loop body into a new one with a better schedule. They model nested loops as multidimensional data-flow graphs, and give a novel mathematical framework for uniform nested loops by using the techniques of retiming and unfolding. Integer linear inequality systems are derived to optimize the execution rate of an iteration. The special case of their framework gives the best-known algorithm for scheduling of one-level loops

Published in:

Parallel Processing Symposium, 1993., Proceedings of Seventh International

Date of Conference:

13-16 Apr 1993