Design and Analysis of a Dynamic Scheduling Strategy with Resource Estimation for Large-Scale Grid Systems

Authors:
Sivakumar Viswanathan;Bharadwaj Veeravalli;Dantong Yu;Thomas G. Robertazzi
Affiliations:
National University of Singapore;National University of Singapore;Brookhaven National Laboratory, Upton, NY;Stony Brook University, NY
Venue:
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Year:
2004

Citing 6
Cited 7

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Ten Reasons to Use Divisible Load Theory

Computer
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better

CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
A Novel Optimal Load Distribution Algorithm for Divisible Loads

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

Cluster Computing

Scheduling divisible loads in the dynamic heterogeneous grid environment

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
New worker-centric scheduling strategies for data-intensive grid applications

Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Efficient on-demand operations in dynamic distributed infrastructures

LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
PPDD: scheduling multi-site divisible loads in single-level tree networks

Cluster Computing
New worker-centric scheduling strategies for data-intensive grid applications

MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Novel adaptive scheduling algorithm for computational grid

IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
A scheduling algorithm based on a trust mechanism in grid

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a resource conscious dynamic scheduling strategy for handling large volume computationally intensive loads in a Grid system involving multiple sources and sinks / processing nodes. We consider a "pull-based" strategy, wherein the processing nodes request load from the sources. We employ the Incremental Balancing Strategy (IBS) algorithm proposed in the literature and propose a buffer estimation strategy to derive optimal load distribution. Here, we consider non-time critical loads that arrive at arbitrary times with time varying buffer availability at sinks and utilize buffer reclamation techniques so as to schedule the loads. We demonstrate detailed workings of the proposed algorithm with illustrative examples using real-life parameters derived from STAR experiments in BNL for scheduling large volume loads.