We consider the problem of scheduling n unit-length tasks on identical m parallel processors, when outforest precedence relations and unit interprocessor communication delays exist. Two algorithms have been proposed in the literature for the exact solution of this problem: a linear time algorithm for the special case m=2, and a dynamic programming algorithm which runs in O(n^{2m-2}). In this paper we give a new linear time algorithm for instances with m=3.
A Linear Time Algorithm for Scheduling Outforests with Communication Delays on Three Processors / Dell'Amico, Mauro; Finta, L.. - In: JOURNAL OF ALGORITHMS. - ISSN 0196-6774. - STAMPA. - 44:2(2002), pp. 287-307. [10.1016/S0196-6774(02)00201-8]
A Linear Time Algorithm for Scheduling Outforests with Communication Delays on Three Processors
DELL'AMICO, Mauro;
2002
Abstract
We consider the problem of scheduling n unit-length tasks on identical m parallel processors, when outforest precedence relations and unit interprocessor communication delays exist. Two algorithms have been proposed in the literature for the exact solution of this problem: a linear time algorithm for the special case m=2, and a dynamic programming algorithm which runs in O(n^{2m-2}). In this paper we give a new linear time algorithm for instances with m=3.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
