Scheduling trees with large communication delays on two identical processors

Authors:
F. Afrati;E. Bampis;L. Finta;I. Milis
Affiliations:
National Technical University of Athens, Athens, Greece 15773;LaMI, Université d'Evry, Evry Cedex, France;LIPN, Université Paris, Villetaneuse Cedex, France 93430;Athens University of Economics and Business, Athens, Greece 10434
Venue:
Journal of Scheduling
Year:
2005

Citing 9
Cited 1

UET scheduling with unit interprocessor communication delays

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

SIAM Journal on Computing
Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays

Information and Computation
The complexity of scheduling trees with communication delays

Journal of Algorithms
Scheduling UET-UCT series-parallel graphs on two processors

Theoretical Computer Science
Scheduling In and Out Forests in the Presence of Communication Delays

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Scheduling Problems with Communication Delays for Trees

SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Optimal architecture-independent scheduling of fine-grain tree-sweep computations

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing

Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling trees on two identical processors in order to minimize the makespan. We assume that tasks have unit execution times, and arcs are associated with large identical integer communication delays. We prove that the problem is NP-hard in the strong sense even when restricted to the class of binary trees, and we provide a polynomial-time algorithm for complete binary trees.