Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling
Open Access
- 1 January 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new Space-Time Genetic Algorithm (STGA) for trusted job scheduling, which is very fast and easy to implement. Under our new model, a job can possibly fail if the site security level is lower than the job security demand. We consider three security-driven heuristic modes: secure, risky, and f-risky. The secure mode always dispatches jobs to secure sites meeting the job security demands. The risky mode allocates jobs to any available resource site, taking whatever the risk it may face. The f-risky mode tries to limit the risk to be at most certain probability f. Our extensive simulation results indicated that the proposed STGA is highly effective in scheduling two types of practical workloads: NAS (Numerical Aerodynamic Simulation) and PSA (parameter-sweep application). The STGA outperforms the Min-Min and Sufferage heuristics under three risk modes, in terms of a wide range of performance metrics including makespan, average response time, site utilization, slowdown ratio, and job failure rate.published_or_final_versioKeywords
This publication has 18 references indexed in Scilit:
- A genetic algorithm based approach for scheduling decomposable data grid applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Job scheduling for prime time vs. non-prime timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A decoupled scheduling approach for Grid application development environmentsJournal of Parallel and Distributed Computing, 2003
- Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational gridPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Security implications of typical Grid Computing usage scenariosPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computingIEEE Transactions on Parallel and Distributed Systems, 2002
- Task assignment with unknown durationJournal of the ACM, 2002
- Static scheduling algorithms for allocating directed task graphs to multiprocessorsACM Computing Surveys, 1999
- Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing SystemsJournal of Parallel and Distributed Computing, 1999
- Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic AlgorithmJournal of Parallel and Distributed Computing, 1997