Design and analysis of a dynamic scheduling strategy with resource estimation for large-scale grid systems

Sivakumar Viswanathan, Bharadwaj Veeravalli, Dantong Yu, Thomas G. Robertazzi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - Fifth IEEE/ACM International Workshop on Grid Computing
EditorsR. Buyya
Pages163-170
Number of pages8
DOIs
StatePublished - 2004
Externally publishedYes
EventProceedings - Fifth IEEE/ACM International Workshop on Grid Computing - Pittsburgh, PA, United States
Duration: Nov 8 2004Nov 8 2004

Publication series

NameProceedings - IEEE/ACM International Workshop on Grid Computing
ISSN (Print)1550-5510

Other

OtherProceedings - Fifth IEEE/ACM International Workshop on Grid Computing
Country/TerritoryUnited States
CityPittsburgh, PA
Period11/8/0411/8/04

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Design and analysis of a dynamic scheduling strategy with resource estimation for large-scale grid systems'. Together they form a unique fingerprint.

Cite this