.png){kind=icon}
.png){kind=icon}
Return
Security Driven Scheduling Model for Computational Grid Using NSGA-II
.png){kind=icon}
PRE
AI
DOI：10.1007/s10723-013-9251-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Number of software applications demands various levels of security at the time of scheduling in Computational Grid. Grid may offer these securities but may result in the performance degradation due to overhead in offering the desired security. Scheduling performance in a Grid is affected by the heterogeneities of security and computational power of resources. Customized Genetic Algorithms have been effectively used for solving complex optimization problems (NP Hard) and various heuristics have been suggested for solving Multi-objective optimization problems. In this paper a security driven, elitist non-dominated sorting genetic algorithm, Optimal Security with Optimal Overhead Scheduling (OSO2S), based on NSGA-II, is proposed. The model considers dual objectives of minimizing the security overhead and maximizing the total security achieved. Simulation results exhibit that the proposed algorithm delivers improved makespan and lesser security overhead in comparison to other such algorithms viz. MinMin, MaxMin, SPMinMin, SPMaxMin and SDSG.
Keywords:
Grid computing
Security-aware scheduling
NSGA-II
Genetic algorithm
Grid security
Security overhead
Journal
IF:
2.9
Papers:
759
Citations:
1.2K