Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Scheduling UET Trees with Communication Delays on two Processors

Frederic Guinand;  Denis Trystman — 2010

RAIRO - Operations Research

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.

Page 1

Download Results (CSV)