DOI QR코드

DOI QR Code

A Two-Step Job Scheduling Algorithm Based on Priority for Cloud Computing

  • Kim, Jeongwon (Department of Computer Engineering, Silla University)
  • Received : 2013.03.07
  • Accepted : 2013.07.17
  • Published : 2013.12.31

Abstract

Cloud systems are popular computing environment because they can provide easy access to computing resources for users as well as efficient use of resources for companies. The resources of cloud computing are heterogeneous and jobs have various characteristics. One such issue is effective job scheduling. Scheduling in the cloud system may be defined as a multiple criteria decision model. To address this issue, this paper proposes a priority-based two-step job scheduling algorithm. On the first level, jobs are classified based on preference. Resources are dedicated to a job if a deadline failure would cause severe results or critical business losses. In case of only minor discomfort or slight functional impairment, the job is scheduled using a best effort approach. On the second level, jobs are allocated to adequate resources through their priorities that are calculated by the analytic hierarchic process model. We then analyze the proposed algorithm and make a scheduling example to confirm its efficiency.

Keywords

References

  1. R. Baraglia, G. Capannini, P. Dazzi, and G. Pagano, "A multicriteria job scheduling framework for large computing farms," Journal of Computer and System Sciences, vol. 79, no. 2, pp. 230- 244, 2013. https://doi.org/10.1016/j.jcss.2012.05.005
  2. E. Deelman, "Grids and clouds: making workflow applications work in heterogeneous distributed environments," International Journal of High Performance Computing Applications, vol. 24, no. 3, pp. 284-298, 2010. https://doi.org/10.1177/1094342009356432
  3. J. Yu, R. Buyya, and C. K. Tham, "Cost-based scheduling of scientific workflow applications on utility grids," in Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing, Melbourne, Australia, pp. 5-8, 2005.
  4. J. Yu and R. Buyya, "A budget constrained scheduling of workflow applications on utility grids using genetic algorithms," in Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, Paris, France, pp. 19-23, 2006.
  5. P. Padala, K. G. Shin, X. Zhu, M. Uysal, Z. Wang, S. Singhal, A. Merchant, and K. Salem, "Adaptive control of virtualized resources in utility computing environments," in Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems, Lisbon, Portugal, pp. 289-302, 2007.
  6. Z. Yu and W. Shi, "A planner-guided scheduling strategy for multiple workflow applications," in Proceedings of the 37th International Conference on Parallel Processing Workshops, Portland, OR, pp. 1-8, 2008.
  7. M. Xu, L. Cui, H. Wang, and Y. Bi, "A multiple QoS constrained scheduling strategy of multiple workflows for cloud computing," in Proceedings of IEEE International Symposium on Parallel and Distributed Processing with Applications, Chengdu, China, pp. 629-634, 2009.
  8. J. Kosinska, J. Kosinski, and K. Zielinski, "The concept of application clustering in cloud computing environments: the need for extending the capabilities of virtual networks," in Proceedings of the 5th International Multi-Conference on Computing in the Global Information Technology, Valencia, Spain, pp. 139-145, 2010.
  9. S. Ghanbaria and M. Othman, "A priority based job scheduling algorithm in cloud computing," in Proceedings of the International Conference on Advances Science and Contemporary Engineering 2012, Jakarta, Indonesia, pp. 778-785, 2012.
  10. T. L. Saaty, Decision Making for Leaders: The Analytical Hierarchy Process for Decisions in a Complex World. Pittsburgh, PA: RWS Publications, 2012.
  11. V. Strassen, "Gaussian elimination is not optimal," Numerische Mathematik, vol. 13, no. 4, pp. 354-356, 1969. https://doi.org/10.1007/BF02165411
  12. S. Robinson, "Toward an optimal algorithm for matrix multiplication," SIAM News, vol. 38, no. 9, 2005.