S. Viswanathan, B. Veeravalli, Dantong Yu, T. Robertazzi
{"title":"Design and analysis of a dynamic scheduling strategy with resource estimation for large-scale grid systems","authors":"S. Viswanathan, B. Veeravalli, Dantong Yu, T. Robertazzi","doi":"10.1109/GRID.2004.19","DOIUrl":null,"url":null,"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. We consider nontime 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.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth IEEE/ACM International Workshop on Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRID.2004.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23
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. We consider nontime 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.