Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Condor-G: A Computation Management Agent for Multi-Institutional Grids
Cluster Computing
Experiments with Scheduling Using Simulated Annealing in a Grid Environment
GRID '02 Proceedings of the Third International Workshop on Grid Computing
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Condor and preemptive resume scheduling
Grid resource management
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Scalable Grid Application Scheduling via Decoupled Resource Selection and Scheduling
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Grid Resource Allocation and Task Scheduling for Resource Intensive Applications
ICPPW '06 Proceedings of the 2006 International Conference Workshops on Parallel Processing
Pegasus: A framework for mapping complex scientific workflows onto distributed systems
Scientific Programming
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
IEEE Transactions on Parallel and Distributed Systems
Advanced reservation-based scheduling of task graphs on clusters
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Modeling user runtime estimates
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Power efficient scheduling heuristics for energy conservation in computational grids
The Journal of Supercomputing
| Hi-index | 0.00 |
The competitiveness of online algorithms is measured based on the correctness of the results produced and processing time efficiency. Traditionally evolutionary algorithms are not favored in online paradigms because of the large number of iterations involved in the algorithm which translates directly into processing time overhead. In this paper we describe MARS (Management Architecture for Resource Services) online scheduling algorithm which uses Simulated Annealing and concepts from Tabu Search to drastically decrease the processing time of the algorithm. The paper outlines the concepts behind MARS, the components involved and scheduling methodology used. In addition we also identify the time consuming bottlenecks in the performance of the system and how evolutionary algorithms help us soar past them.