Scheduling Trees with Large Communication Delays on Two Identical Processors

Authors:
Foto N. Afrati;Evripidis Bampis;Lucian Finta;Ioannis Milis
Affiliations:
-;-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 8
Cited 1

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

ESA'05 Proceedings of the 13th annual European conference on Algorithms

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 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.