By Topic

Scheduling tasks with communication delays on a two-levels virtual distributed system

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)
Colin, J.-Y. ; Lab. d''Inf., Le Havre Univ., France ; Nakechbandi, M.

A set of tasks has to be scheduled on the parallel identical processors of the clusters of a two-levels distributed memory multiprocessor, subject to precedence constraints and small intra-cluster communication delays. The architecture model includes network of shared memory multiprocessors. In this paper, we present a new critical-path like algorithm that finds an optimal solution to this new problem in polynomial time, if task duplication is allowed and the number of available processors is not limited. The solution found is an earliest schedule that spreads the tasks between the clusters and the processors

Published in:

Parallel and Distributed Processing, 1999. PDP '99. Proceedings of the Seventh Euromicro Workshop on

Date of Conference:

3-5 Feb 1999