Scheduling UET-UCT Series-Parallel Graphs on Two ProcessorsReportar como inadecuado




Scheduling UET-UCT Series-Parallel Graphs on Two Processors - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 MISTRAL - Modeling of Computer Systems and Telecommunication Networks : Research and Software Development CRISAM - Inria Sophia Antipolis - Méditerranée

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.

Keywords : PRECEDENCE CONSTRAINT SERIES-PARALLEL GRAPHS OPTIMAL ALGORITHM COMPLEXITY SCHEDULING MAKESPAN





Autor: Lucian Finta - Zhen Liu Ioannis Milis Evripidis Bampis

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados