By Topic

On systolic contractions of program graphs

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)
W. Shen ; Dept. of Electr. Eng., New Hampshire Univ., Durham, NH, USA ; A. Y. Oruc

A variant of the mapping problem, namely, systolic contractions of program graphs, is considered. The notion of time links is introduced to mechanize the contraction process; the timing of information flow between processors is modeled in terms of fundamental loop and path equations of delays and is optimized using linear programming. While the results apply primarily to systolic contractions, they can be extended to other types of graph contractions by relaxing the time constraints imposed by delay equations. Such contractions can, in principle, lead to faster execution of program graphics, since they may do away with the delays imposed on the links between the processors by systolic contractions. Clearly, storage is traded for time since extra storage may be necessary to hold some operands temporarily until a processor acquires all of its operands for a computation

Published in:

IEEE Transactions on Computers  (Volume:38 ,  Issue: 10 )