A Linear Time Algorithm For Scheduling Outforests With Communication Delays On Three Processors

We consider the problem of scheduling n unit-length tasks on identical in 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 to 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. (C) 2002 Elsevier Science (USA). All rights reserved.