By Topic

Optimal within a constant schedules for forest dags on parallel architectures

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)
Kalpakis, K. ; Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA ; Yesha, Y.

The authors provide optimal within a constant explicit upper bounds on the makespan of schedules for bounded degree forest structured programs on mesh arrays of processors with links of unit bandwidth and arbitrary positive integer propagation delay, and provide polynomial time algorithms to find schedules with makespan matching these bounds. Thus, The authors provide the first polynomial time approximation algorithm for this NP-hard problem, with performance ratio that is a constant. Programs with forest structure arise often in important classes of algorithms. The mesh array architecture is widely used for actual parallel computers. Further, the authors provide polynomial time computable schedules for forest structured programs on a wide class of parallel architectures. They also show how to schedule, in polynomial time, a complete binary tree structured program on a linear array with optimal within a factor of 1 + o(1) makespan

Published in:

Advances in Parallel and Distributed Systems, 1993., Proceedings of the IEEE Workshop on

Date of Conference:

6 Oct 1993