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.
Type de document :
Rapport
RR-2566, INRIA. 1995
Liste complète des métadonnées

https://hal.inria.fr/inria-00074115
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:33:15
Dernière modification le : samedi 27 janvier 2018 - 01:31:30
Document(s) archivé(s) le : jeudi 24 mars 2011 - 14:15:18

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

164

Téléchargements de fichiers

137