Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Compile time vs. runtime: scheduling parallelism on dataflow machines

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

3 Author(s)
Beck, M. ; Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA ; Pingali, K. ; Nicolau, A.

Summary form only given. Exploitation of parallelism in programs decreases execution time but increases resource requirements. It is argued that this problem should be addressed by applying compile-time analysis and static scheduling techniques. Such techniques have been developed for scheduling loops on very long instruction word (VLIW) machines which, like dataflow machines, can exploit fine-grain parallelism in programs. In VLIW machines, all resources can be scheduled very precisely because of the synchronous model of parallelism. It is shown how these techniques can be applied to dataflow machines by adopting a less rigid notion of scheduling providing a reasonable trade-off between parallelism and resource usage. The authors also show how such asynchronous scheduling can be implemented in a novel dataflow loop schema for the Monsoon Explicit Token Store dataflow machine

Published in:

TENCON '89. Fourth IEEE Region 10 International Conference

Date of Conference:

22-24 Nov 1989