Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays

Authors:
Noriyuki Fujimoto;Kenichi Hagihara
Affiliations:
-;-
Venue:
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Year:
2001

Citing 9
Cited 0

Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
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 In and Out Forests in the Presence of Communication Delays

IEEE Transactions on Parallel and Distributed Systems
Optimal Scheduling Algorithm for Distributed-Memory Machines

IEEE Transactions on Parallel and Distributed Systems
On Exploiting Task Duplication in Parallel Program Scheduling

IEEE Transactions on Parallel and Distributed Systems
On the Granularity and Clustering of Directed Acyclic Task Graphs

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
The Complexity of Scheduling Problems with Communication Delays for Trees

SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that task scheduling problem of a complete k-ary intree with unit time tasks and general communication delays onto an unlimited number of processors is NP-complete. In this paper, we show that such a problem can be solved in linear time if we restrict communication delays within the range from (k-1) to k unit times. We also show that naive scheduling is optimal if communication delays are constant and at most (k - 1) unit times.