Volume 34, Number 2, April June 2000
|Page(s)||131 - 144|
|Published online||15 August 2002|
Scheduling UET Trees with Communication Delays on two Processors
LIH Universite du Havre, BP. 540,
76058 Le Havre Cedex, France.
2 LMC-IMAG Domaine Universitaire, BP. 53, 38041 Grenoble Cedex, France.
In this paper, we present a new linear time algorithm for scheduling UECT (Unit Execution and Communication Time) trees on two identical processors. The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non UECT tasks.
Key words: Parallel processing / scheduling / intrees / UECT / communication Delays.
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.