Authors: Rekha Kashyap, Deo Prakash Vidyarthi
Addresses: School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi 110067, India. ' School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi 110067, India
Abstract: Security-aware scheduling for real-time grid applications is an important task and a little work has been done to accomplish this. In this paper, we propose two scheduling algorithms for real-time grid applications with stringent security requirements, and the proposed algorithms are compared with a few existing scheduling algorithms, i.e. MinMin, MaxMin, EDF/ECT, SPMinMin and SPMaxMin. Security overhead computation for existing and proposed models is done on the basis of security level demand of the tasks. Performance of WB-EDFMin on success rate performance metric is considered to be the best among all the contemporary scheduling algorithms. SFWB-EDFMin compromises on the overall success rate of the grid application but its task scheduling is uniformly spread over the tasks of all security levels.
Keywords: grid computing; real-time secured scheduling; security-aware scheduling; grid scheduling; CipherSuite; success rate; average response time; security.
International Journal of Grid and Utility Computing, 2011 Vol.2 No.4, pp.313 - 325
Published online: 08 Oct 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article