This paper proposes a novel schedule-based approach for scheduling a continuous stream of batch jobs on the machines of a computational Grid. Our new solutions represented by dispatching rule Earliest Gap- Earliest Deadline First (EG-EDF) and Tabu search are based on the idea of filling gaps in the existing schedule. EG-EDF rule is able to build the schedule for all jobs incrementally by applying technique which fills earliest existing gaps in the schedule with newly arriving jobs. If no gap for a coming job is available EG-EDF rule uses Earliest Deadline First (EDF) strategy for including new job into the existing schedule. Such schedule is then optimized using the Tabu search algorithm moving jobs into earliest gaps again. Scheduling choices are taken to meet the Quality of Service (QoS) requested by the submitted jobs, and to optimize the usage of hardware resources. We compared the proposed solution with some of the most common queue-based scheduling algorithms like FCFS, EASY backfilling, and Flexible backfilling. Experiments shows that EG-EDF rule is able to compute good assignments, often with shorter algorithm runtime w.r.t. the other queue-based algorithms. Further Tabu search optimization results in higher QoS and machine usage while keeping the algorithm runtime reasonable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Abraham, R. Buyya, and B. Nath. Nature’s heuristics for scheduling jobs on computational Grids. In The 8th IEEE International Conference on Advanced Computing and Communications (ADCOM 2000), pages 45-52, 2000.
V. A. Armentano and D. S. Yamashita. Tabu search for scheduling on identical parallel machines to minimize mean tardiness. Journal of Intelligent Manufacturing, 11:453-460, 2000.
R. Baraglia, R. Ferrini, and P. Ritrovato. A static mapping heuristics to map parallel applications to heterogeneous computing systems: Research articles. Concurrency and Computation: Practice and Experience, 17(13):1579-1605, 2005.
J. Bidot. A General Framework Integrating Techniques for Scheduling under Uncertainty. PhD thesis, Institut National Polytechnique de Toulouse, 2005.
G. Capannini, R. Baraglia, D. Puppin, L. Ricci, and M. Pasquali. A job scheduling framework for large computing farms. In ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC’07), 2007.
Cluster Resources. Moab Workload Manager Administrator’s Guide, 2008.
J. P. Jones. PBS Professional 7, Administrator Guide. Altair, April 2005.
F. W. Glover and G. A. Kochenberger, editors. Handbook of Metaheuristics. Kluwer, 2003.
F. W. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1998.
M. Hovestadt, O. Kao, A. Keller, and A. Streit. Scheduling in HPC Resource Management Systems: Queuing vs. Planning. In Job Scheduling Strategies for Parallel Processing, volume 2862 of LNCS, pages 1-20. Springer, 2003.
E. Huedo, R. Montero, and I. Llorente. The GridWay framework for adaptive scheduling and execution on Grids. Scalable Computing: Practice and Experience, 6(3):1-8, 2005.
D. Klusáček, L. Matyska, and H. Rudová. Alea - Grid Scheduling Simulation Environment. In Workshop on scheduling for parallel computing at the 7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), LNCS. Springer, 2008. To appear.
D. Klusáček, L. Matyska, H. Rudová, R. Baraglia, and G. Capannini. Local Search for Grid Scheduling. In Doctoral Consortium at the International Conference on Automated Planning and Scheduling (ICAPS’07), USA, 2007.
D. A. Lifka. The ANL/IBM SP Scheduling System. In Job Scheduling Strategies for Parallel Processing, volume 949 of LNCS, pages 295-303. Springer, 1995.
A. W. Mu’alem and D. G. Feitelson. Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Transactions on Parallel and Distributed Systems, 12(6):529-543, 2001.
M. Pinedo. Planning and Scheduling in Manufacturing and Services. Springer, 2005.
K. Stucky, W. Jakob, A. Quinte, and W. Süß. Solving scheduling problems in Grid resource management using an evolutionary algorithm. In R. Meersman and Z. Tari, editors, OTM Conferences (2), volume 4276 of LNCS, pages 1252- 1262. Springer, 2006.
R. Subrata, A. Y. Zomaya, and B. Landfeldt. Artificial life techniques for load balancing in computational Grids. Journal of Computer and System Sciences, 73(8):1176-1190, 2007.
W. Süß, W. Jakob, A. Quinte, and K. Stucky. GORBA: A global optimis-ing resource broker embedded in a Grid resource management system. In S. Zheng, editor, International Conference on Parallel and Distributed Computing Systems, PDCS 2005, pages 19-24. IASTED/ACTA Press, 2005.
A. D. Techiouba, G. Capannini, R. Baraglia, D. Puppin, and M. Pasquali. Back- filling strategies for scheduling streams of jobs on computational farms. In CoreGRID Workshop on Grid Programming Model, Grid and P2P Systems Ar- chitecture, Grid Systems, Tools and Environments. Springer, 2008. To appear.
D. Thain, T. Tannenbaum, and M. Livny. Distributed computing in practice: the Condor experience. Concurrency - Practice and Experience, 17(2-4):323- 356, 2005.
S. Venugopal, R. Buyya, and L. Winton. A Grid Service Broker for scheduling distributed data-oriented applications on global Grids. In MGC ’04: Proceedings of the 2nd workshop on Middleware for grid computing, pages 75-80. ACM Press, 2004.
M. Q. Xu. Effective metacomputing using LSF multicluster. In CCGRID ’01: Proceedings of the 1st International Symposium on Cluster Computing and the Grid, pages 100-105. IEEE Computer Society, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Klusáček, D., Rudová, H., Baraglia, R., Pasquali, M., Capannini, G. (2008). Comparison Of Multi-Criteria Scheduling Techniques. In: Gorlatch, S., Fragopoulou, P., Priol, T. (eds) Grid Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09457-1_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-09457-1_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09456-4
Online ISBN: 978-0-387-09457-1
eBook Packages: Computer ScienceComputer Science (R0)