DocumentCode
3227208
Title
Adaptive Replication Based Security Aware and Fault Tolerant Job Scheduling for Grids
Author
Jiang, Congfeng ; Wang, Cheng ; Liu, Xiaohu ; Zhao, Yinghui
Author_Institution
Huazhong Univ. of Sci. & Technol., Wuhan
Volume
2
fYear
2007
fDate
July 30 2007-Aug. 1 2007
Firstpage
597
Lastpage
602
Abstract
Most of the existing job scheduling algorithms for grids have ignored the security problem with a handful of exceptions. Moreover, existing algorithms using fixed- number job replications will consume excessive resources when grid security level changes dynamically. In this paper, a security aware and fault tolerant scheduling (SAFTS) algorithm based on adaptive replication is proposed which schedules the jobs by matching the user security demand and resource trust level and the number of the job replications changes adaptively with the dynamic of grid security. In experiments on RSBSME (remote sensing based soil moisture extraction) workload in a real grid environment, the average job scheduling success rate is 97%, and average grid utilization is 74%. Experiment results show that performance of SAFTS is better than non-security-aware and fixed-number job replication scheduling algorithms and SAFTS is fault-tolerant and scalable.
Keywords
fault tolerant computing; grid computing; scheduling; security of data; adaptive replication; fault tolerant scheduling; grid security; job scheduling; resource trust level; security aware scheduling; user security demand; Artificial intelligence; Computational modeling; Computer networks; Distributed computing; Dynamic scheduling; Fault tolerance; Processor scheduling; Scheduling algorithm; Security; Software engineering;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on
Conference_Location
Qingdao
Print_ISBN
978-0-7695-2909-7
Type
conf
DOI
10.1109/SNPD.2007.292
Filename
4287753
Link To Document