DocumentCode
2104497
Title
A Benefit Driven Grid Jobs Scheduling Heuristic Algorithm
Author
Hao, Yongsheng ; Wang, Jun ; Li, Shiqing ; Liu, Guanfeng
Author_Institution
Network Center, Nanjing Univ. of Inf. Sci. & Technol., Nanjing
fYear
2008
fDate
21-22 Dec. 2008
Firstpage
320
Lastpage
323
Abstract
This paper proposes a grid job scheduling algorithm based on Dempster-Shater theory. The value of the expectation trust benefit function is the prediction benefit of a certain job which executes in the grid. This parameter can be used to detect the behaviors of resource providers in grid. Simulation experiments prove that benefit driven algorithm is better than conversional Min-min algorithm in benefit. This paper also gives the implementation of the mechanism.
Keywords
grid computing; inference mechanisms; resource allocation; scheduling; security of data; Dempster-Shater theory; benefit driven grid job scheduling; expectation trust benefit function; grid resource; heuristic algorithm; trust management system; Application software; Cross layer design; Heuristic algorithms; Inference algorithms; Information technology; Intelligent networks; Processor scheduling; Resource management; Scheduling algorithm; Utility programs;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Information Technology Application Workshops, 2008. IITAW '08. International Symposium on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3505-0
Type
conf
DOI
10.1109/IITA.Workshops.2008.216
Filename
4731942
Link To Document