Security-aware and Self-adaptive Job Replication Scheduling in Grids
When scheduling a large number of user jobs for parallel execution on a real Grid system,most existing scheduling algorithms use fixed-number job replications to provide high scheduling success rate and fault tolerance.Three security-aware scheduling algorithms based on self-adaptive replication were proposed,namely,Simple Adaptive Replication、K-Percent Replication and Lazy Replication.The number of the job replications changes adaptively according to the dynamics of grid security.In risky and failure-prone grids,the proposed algorithms are robust due to their self-adaptive job replications and rescheduling mechanism.Simulation results show that the self-adaptive job replication based algorithms are fault-tolerant,scalable,and better than non-security-aware and fixed-number job replication based scheduling algorithms.