Divisible Load Scheduling in Systems with Limited Memory

Authors:
M. Drozdowski;P. Wolniewicz
Affiliations:
Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 3A, 60-965 Poznań, Poland;Poznań Supercomputing and Networking Center, ul. Noskowskiego 10, 61-794 Poznań, Poland
Venue:
Cluster Computing
Year:
2003

Citing 7
Cited 7

Integer and combinatorial optimization

Integer and combinatorial optimization
A computational view of interior point methods

Advances in linear and integer programming
Divisible task scheduling — concept and verification

Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Scheduling divisible loads in a three-dimensional mesh of processors

Parallel Computing
Scheduling a divisible task in a two-dimensional toroidal mesh

Proceedings of the third international conference on Graphs and optimization
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

Multiround Algorithms for Scheduling Divisible Loads

IEEE Transactions on Parallel and Distributed Systems
Data Partitioning with a Functional Performance Model of Heterogeneous Processors

International Journal of High Performance Computing Applications
Data partitioning for multiprocessors with memory heterogeneity and memory constraints

Scientific Programming - International Symposium of Parallel and Distributed Computing & International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogenous Networks
Experimental study of scheduling with memory constraints using hybrid methods

Journal of Computational and Applied Mathematics
Heuristics for multi-round divisible loads scheduling with limited memory

Parallel Computing
Multi-installment divisible load processing in heterogeneous systems with limited memory

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Improving Performance on Data-Intensive Applications Using a Load Balancing Methodology Based on Divisible Load Theory

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we consider scheduling divisible loads on a distributed computing system with limited available memory. The communication delays and heterogeneity of the system are taken into account. The problem studied consists in finding such a distribution of the load that the communication and computation time is the shortest possible. A new robust method is proposed to solve the problem of finding optimal distribution of computations on star network, and networks in which binomial trees can be embedded (meshes, hypercubes, multistage interconnections). We demonstrate that in many cases memory limitations do not restrict efficiency of parallel processing as much as computation and communication speeds.