Security-Driven Scheduling Model for Computational Grid using Genetic Algorithm

The conflict between achieving good performance in terms of time etc. and achieving high quality of security protection introduces new challenges in security critical grid scheduling. Extensive study indicates that the scheduling performance is affected by the heterogeneities of security and computational power of resources. Different tasks may have varied security requirement and even for the same security requirement, security overhead may vary for different node at which the task is scheduled. In this paper, a security driven scheduling using genetic algorithm (SDSG) is proposed which aims at maximizing security while restricting security overhead under a certain limit. Extensive simulation results over dynamically created heterogeneous grid environment reveal that SDSG achieves better security and exhibit less security overhead and makespan in comparison to other such algorithms viz. MinMin MaxMin, SPMinMin and SPMaxMin.