An adaptive resource scheduling algorithm for computational grid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

The emerging computational grid infrastructure consists of heterogeneous resource in widely distributed autonomous domains, which makes resource scheduling even more challenging. In this paper, we propose an adaptive resource scheduling algorithm for computational grid called BLBD (Based on Load Balancing and Demand). According to the computational grid job's personal resource requirements, the system load of computational grid nodes and the load balancing of computational grid system, the algorithm choose an appropriate node self-adaptively for computational grid job from the candidates. It has been successfully tested in NPU Campus Computational Grid environment. The experimental result shows that the new task scheduling algorithm can lead to significant performance gain for a variety of applications

Original languageEnglish
Title of host publicationProceedings of 2006 IEEE Asia-Pacific Conference on Services Computing, APSCC
Pages447-450
Number of pages4
DOIs
StatePublished - 2006
Event2006 IEEE Asia-Pacific Conference on Services Computing, APSCC - Guangzhou, Guangdong, China
Duration: 12 Dec 200615 Dec 2006

Publication series

NameProceedings of 2006 IEEE Asia-Pacific Conference on Services Computing, APSCC

Conference

Conference2006 IEEE Asia-Pacific Conference on Services Computing, APSCC
Country/TerritoryChina
CityGuangzhou, Guangdong
Period12/12/0615/12/06

Fingerprint

Dive into the research topics of 'An adaptive resource scheduling algorithm for computational grid'. Together they form a unique fingerprint.

Cite this