Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources

Authors:
Debasish Ghose;Hyoung Joong Kim;Tae Hoon Kim
Affiliations:
IEEE;IEEE;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2005

Citing 14
Cited 11

Partitioning Techniques for Large-Grained Parallelism

IEEE Transactions on Computers
QoS-aware resource management for distributed multimedia applications

Journal of High Speed Networks - Special issue on multimedia networking
Using MPI (2nd ed.): portable parallel programming with the message-passing interface

Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Parallel Processor Configuration Design with Processing/Transmission Costs

IEEE Transactions on Computers
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis

IEEE Transactions on Parallel and Distributed Systems
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
A Feedback Strategy for Load Allocation in Workstation Clusters with Unknown Network Resource Capabilities Using the DLT Paradigm

PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 1
Ten Reasons to Use Divisible Load Theory

Computer
An integrated runtime QoS-aware middleware framework for distributed multimedia applications

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

Cluster Computing
Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks

Cluster Computing
Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks

Cluster Computing
Out-of-core divisible load processing

IEEE Transactions on Parallel and Distributed Systems

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

IEEE Transactions on Parallel and Distributed Systems
Adaptive Load Distribution Strategies for Divisible Load Processing on Resource Unaware Multilevel Tree Networks

IEEE Transactions on Computers
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems

IEEE Transactions on Parallel and Distributed Systems
PPDD: scheduling multi-site divisible loads in single-level tree networks

Cluster Computing
Design, analysis, and performance evaluation of an efficient resource unaware scheduling strategy for processing divisible loads on distributed linear Daisy chain networks

HiPC'08 Proceedings of the 15th international conference on High performance computing
Adaptive statistical scheduling of divisible workloads in heterogeneous systems

Journal of Scheduling
A delay-based dynamic load balancing method and its stability analysis and simulation

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
A strategyproof mechanism for scheduling divisible loads in bus networks without control processors

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An incentive-based distributed mechanism for scheduling divisible loads in tree networks

Journal of Parallel and Distributed Computing
A generalized linear programming based approach to optimal divisible load scheduling

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Requirement-aware strategies for scheduling real-time divisible loads on clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventional divisible load scheduling algorithms attempt to achieve optimal partitioning of massive loads to be distributed among processors in a distributed computing system in the presence of communication delays in the network. However, these algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these parameters. In this paper, we present an adaptive strategy that estimates network parameter values using a probing technique and uses them to obtain optimal load partitioning. Three algorithms, based on the same strategy, are presented in the paper, incorporating the ability to cope with unknown network parameters. Several illustrative numerical examples are given. Finally, we implement the adaptive algorithms on an actual network of processor nodes using MPI implementation and demonstrate the feasibility of the adaptive approach.