Scheduling UET Trees with Communication Delays on two Processors

Guinand, Frederic, and Trystman, Denis. "Scheduling UET Trees with Communication Delays on two Processors." RAIRO - Operations Research 34.2 (2010): 131-144. <http://eudml.org/doc/197796>.

@article{Guinand2010,
abstract = { 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. },
author = {Guinand, Frederic, Trystman, Denis},
journal = {RAIRO - Operations Research},
keywords = {Parallel processing; scheduling; intrees; UECT; communication Delays.; parallel processing; communication delays},
language = {eng},
month = {3},
number = {2},
pages = {131-144},
publisher = {EDP Sciences},
title = {Scheduling UET Trees with Communication Delays on two Processors},
url = {http://eudml.org/doc/197796},
volume = {34},
year = {2010},
}

TY - JOUR
AU - Guinand, Frederic
AU - Trystman, Denis
TI - Scheduling UET Trees with Communication Delays on two Processors
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 34
IS - 2
SP - 131
EP - 144
AB - 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.
LA - eng
KW - Parallel processing; scheduling; intrees; UECT; communication Delays.; parallel processing; communication delays
UR - http://eudml.org/doc/197796
ER -