Abstract
Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm to achieve load balancing. Most of the researchers have focus on schedule-based algorithms such as genetic algorithm and particle swarm optimization to solve this problem and use priority rules algorithms as initial schedule in those algorithms. The main reason this paper was produced is that most of these researchers failed to justify why they use a specific priority rules scheduler as initial schedule in their work. This paper addresses this issue by presenting a comparison results on several priority rules algorithms based on several performance metrics. To add novelty to this paper, we have proposed several schedule-based algorithms that basically based on the combination of backfilling technique and priority rules algorithms. Our results show the significant improvements compared to the original priority rules algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abraham, A., Buyya, R., Nath, B.: Nature’s heuristics for scheduling jobs on computational Grids. In: Proceedings of the 8th International Conference on Advanced Computing and Communications, pp. 45–52. Tata McGraw-Hill, India (2000)
Boeres, C., Lima, A., Rebello, V.E.: Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics. In: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing. IEEE Computer Society, Washington, DC (2003)
Brucker, P.: Scheduling Algorithms. Springer, Berlin (2007)
Carretero, J., Xhafa, F.: Use of Genetic Algorithms for Scheduling Jobs in Large Scale Grid Applications. Journal of Technological and Economic Development, A Research Journal of Vilnius Gediminas Technical University 12(1), 11–17 (2006), ISSN 1392-8619
Chronopoulos, A.T., Benche, M., Grosu, D., Andonie, R.: A Class of Loop Self-Scheduling for Heterogeneous Clusters. In: Proceedings of the 3rd IEEE international Conference on Cluster Computing. IEEE Computer Society, Washington, DC (2001)
Garrido, J.M.: Performance modeling of operating systems using object-oriented simulation: a practical introduction. Kluwer Academic Publishers, Norwell (2000)
Henderson, R.: Job scheduling under the portable batch system. In: Job Scheduling Strategies for Parallel Processing, pp. 337–360. Springer, Berlin (1995)
Jackson, D., Snell, Q., Clement, M.: Core Algorithms of the Maui Scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 87–102. Springer, Heidelberg (2001)
Klusáček, D., Matyska, L., Rudová, H.: Alea – grid scheduling simulation environment. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2007. LNCS, vol. 4967, pp. 1029–1038. Springer, Heidelberg (2008)
Klusacek, D., Rudova, H.: Improving QoS in Computational Grids through Schedule-based Approach. In: Scheduling and Planning Applications Workshop (SPARK) at the International Conference on Automated Planning and Scheduling (ICAPS 2008), Sydney (2008)
Klusacek, D., Rudová, H., Baraglia, R., Pasquali, M., Capannini, G.: Comparison of Multi Criteria Scheduling Techniques. In: CoreGRID Integration Workshop 2008. Integrated Research in Grid Computing. CoreGRID series. Springer, Heidelberg (2008)
Lifka, D.: The ANL/IBM SP Scheduling System. In: Job Scheduling Strategies for Parallel Processing (JSSPP), pp. 295–303 (1995)
Rasooli, A., Mirza-Aghatabar, M., Khorsandi, S.: Introduction of Novel Rule Based Algorithms for Scheduling in Grid Computing Systems. In: Second Asia International Conference on Modeling & Simulation (2008)
Singh, S.K.: Efficient Grid Scheduling Algorithm based on Priority Queues. Master of Engineering in Software Engineering Thapar University, Patiala (2008)
Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, S.: Characterization of backfilling strategies for parallel job scheduling. In: Proceedings of the International Conference on Parallel Processing Workshops, pp. 514–519. IEEE Computer Society Press, Los Alamitos (2002)
Techiouba, A.D., Capannini, G., Baraglia, R., Puppin, D., Pasquali, L., Ricci, M.: Backfilling Strategies for Scheduling Streams of Jobs on Computational Farms. Making Grids Work, CoreGRID series. Springer, Heidelberg (2008)
Tsafrir, D., Etsion, Y., Feitelson, D.G.: Backfilling Using System-Generated Predictions Rather than User Runtime Estimates. IEEE Transactions on Parallel and Distributed Systems 18(6), 789–803 (2007)
Xhafa, F., Abraham, A.: Meta-heuristics for Grid Scheduling Problems. In: Metaheuristics for Scheduling in Distributed Computing Environments. Series Studies in Computational Intelligence, vol. 146, pp. 1–37. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
M Azmi, Z.R., Abu Bakar, K., Abdullah, A.H., Shamsir, M.S., Romli, R.N., MD Sharif, S.A. (2011). Grid Jobs Scheduling Improvement Using Priority Rules and Backfilling. In: Mohamad Zain, J., Wan Mohd, W.M.b., El-Qawasmeh, E. (eds) Software Engineering and Computer Systems. ICSECS 2011. Communications in Computer and Information Science, vol 179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22170-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-22170-5_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22169-9
Online ISBN: 978-3-642-22170-5
eBook Packages: Computer ScienceComputer Science (R0)