Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074115
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:33:15 PM
Last modification on : Saturday, January 27, 2018 - 1:31:30 AM
Long-term archiving on: : Thursday, March 24, 2011 - 2:15:18 PM

Identifiers

  • HAL Id : inria-00074115, version 1

Collections

Citation

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

Share

Metrics

Record views

200

Files downloads

234