Scheduling UET-UCT Series-Parallel Graphs on Two Processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1995

Scheduling UET-UCT Series-Parallel Graphs on Two Processors

Abstract

The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unit-execution-time, and arcs are associated with unit-communication-time delays. The problem is to assign the tasks to the two processors and schedule their execution in order to minimize the makespan. A quadratic algorithm is proposed to compute an optimal schedule for a class of series-parallel graphs, which includes in particular in-forests and out-forests.
Fichier principal
Vignette du fichier
RR-2566.pdf (305.29 Ko) Télécharger le fichier

Dates and versions

inria-00074115 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074115 , version 1

Cite

Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis. Scheduling UET-UCT Series-Parallel Graphs on Two Processors. RR-2566, INRIA. 1995. ⟨inria-00074115⟩
78 View
131 Download

Share

Gmail Facebook X LinkedIn More