Scheduling UET-UCT series-parallel graphs on two processors

Lucian Finta, Zhen Liu, Ioannis Mills, Evripidis Bampis
1996 Theoretical Computer Science  
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, called SPl graphs, which includes in particular in-forests and out-forests.
doi:10.1016/0304-3975(96)00035-7 fatcat:n6prmtmyvzbunnthwrdrkd5zwa