A linear time algorithm for scheduling outforests with communication delays on three processors

Authors:
Mauro Dell'Amico;Lucian Finta
Affiliations:
Dipartimento di Scienze e Metodi dell'Ingegneria, Università di Modena e Reggio Emilia, viale Allegri, 15, 42100 Reggio Emilia, Italy;Laboratoire d'Informatique de Paris Nord, Université Paris 13, Avenue Jean-Baptiste Clément, 93430 Villetaneuse, France
Venue:
Journal of Algorithms
Year:
2002

Citing 4
Cited 0

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
The complexity of scheduling trees with communication delays

Journal of Algorithms
Scheduling In and Out Forests in the Presence of Communication Delays

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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(n2m-2). In this paper we give a new linear time algorithm for instances with m = 3.