An expectation trust benefit driven algorithm for resource scheduling in grid computing

Hao Yongsheng*, Xu Yuebin, Liu Guanfeng, Pan Zhenkuan

*Corresponding author for this work

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

3 Citations (Scopus)

Abstract

In traditional Grid resource allocation solutions, the jobs with high-quality required may not be executed when they were allocated to low-quality offered nodes because of the separation of trust mechanism and job schedule mechanisms. Therefore, this paper combines the two mechanisms, proposes Grid job schedule arithmetic driven by the expectation trust benefit. The value of the expectation trust benefit function is the prediction benefit of a certain job which executes in Grid. Simulation experiments prove that expectation trust benefit driven arithmetic is better than conversional min-min arithmetic in benefit and it also has a good performance in trust benefit.

Original languageEnglish
Title of host publication3rd International Conference on Innovative Computing Information and Control, ICICIC'08
DOIs
Publication statusPublished - 2008
Event3rd International Conference on Innovative Computing Information and Control, ICICIC'08 - Dalian, Liaoning, China
Duration: 18 Jun 200820 Jun 2008

Other

Other3rd International Conference on Innovative Computing Information and Control, ICICIC'08
Country/TerritoryChina
CityDalian, Liaoning
Period18/06/0820/06/08

Fingerprint

Dive into the research topics of 'An expectation trust benefit driven algorithm for resource scheduling in grid computing'. Together they form a unique fingerprint.

Cite this