A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms

Authors:
L. Marchal;Y. Yang;H. Casanova;Y. Robert
Affiliations:
CNRS-INRIA, École Normale Supérieure de Lyon, France;University of California, San Diego, USA;University of California, San Diego, USA;CNRS-INRIA, École Normale Supérieure de Lyon, France
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Year:
2005

Citing 20
Cited 8

Data networks

Data networks
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Models and scheduling algorithms for mixed data and task parallel programs

Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Asymptotically optimal algorithms for job shop scheduling and packet routing

Journal of Algorithms
Optimal use of mixed task and data parallelism for pipelined computations

Journal of Parallel and Distributed Computing
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Optimizing execution of component-based applications using group instances

Future Generation Computer Systems - Best papers from symp. on cluster computing and the grid (CCGRID 2001)
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job

IEEE Transactions on Computers
Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees

IEEE Transactions on Parallel and Distributed Systems
Executing multiple pipelined data analysis operations in the grid

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Ten Reasons to Use Divisible Load Theory

Computer
Scheduling Distributed Applications: the SimGrid Simulation Framework

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Scheduling divisible workloads on heterogeneous platforms

Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms

IEEE Transactions on Parallel and Distributed Systems
Foreword (Special Issue of Cluster Computing on Divisible Load Scheduling)

Cluster Computing
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems

IEEE Transactions on Parallel and Distributed Systems
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
Modeling Internet topology

IEEE Communications Magazine

An Accurate Communication Model of a Heterogeneous Cluster Based on a Switch-Enabled Ethernet Network

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
Dimensioning and on-line scheduling in Lambda Grids using divisible load concepts

The Journal of Supercomputing
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems

IEEE Transactions on Parallel and Distributed Systems
Grid scheduling divisible loads from two sources

Computers & Mathematics with Applications
PPDD: scheduling multi-site divisible loads in single-level tree networks

Cluster Computing
Scheduling in multi-organization grids: measuring the inefficiency of decentralization

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Scheduling multiple DAGs onto heterogeneous systems

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Multi-source task scheduling in grid computing environment using linear programming

International Journal of Computational Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Divisible load applications consist of an amount of data and associated computation that can be divided arbitrarily into any number of independent pieces. Thismodel is a good approximation of many real-world scientific applications, lends itself to a natural master-worker implementation, and has thus received a lot of attention. The issue of divisible load scheduling has been studied extensively. However, only a few authors have explored the simultaneous scheduling of multiple such applications on a distributed computing platform.Wefocus on this increasingly relevant scenario and make the following contributions. We use a novel and more realistic platform model that captures some of the fundamental network properties of grid platforms. We formulate the steady-state multiapplication scheduling problem as a linear program that expresses a notion of fairness between applications. This scheduling problem is NP-complete and we propose several heuristics that we evaluate and compare via extensive simulation experiments. Our main finding is that some of our heuristics can achieve performance close to optimal and we quantify the trade-offs between achieved performance and heuristic complexity.