Scheduling multiple divisible loads in homogeneous star systems

Authors:
M. Drozdowski;M. Lawenda
Affiliations:
Institute of Computing Science, Poznań University of Technology, Poznań, Poland 60-965;Poznań Supercomputing and Networking Center, Poznań, Poland 61-704
Venue:
Journal of Scheduling
Year:
2008

Citing 4
Cited 1

Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in 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
Ten Reasons to Use Divisible Load Theory

Computer
A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments

IEEE Transactions on Parallel and Distributed Systems

Adaptive statistical scheduling of divisible workloads in heterogeneous systems

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze scheduling multiple divisible loads on a star-connected system of identical processors. It is shown that this problem is computationally hard. Some special cases appear to be particularly difficult, so it is not even known if they belong to the class NP. Exponential algorithms and special cases solvable in polynomial time are presented.