Abstract
In this work, we consider heuristic algorithms for parallel jobs execution and efficient resources allocation in distributed computing environments. Existing modern job-flow execution features and realities impose many restrictions for the resources allocation procedures. Grid and many other high performance computing services operate in heterogeneous and usually geographically distributed computing environments. Emerging virtual organizations and incorporated economic scheduling models allow users and resource owners to compete for suitable allocations based on market principles and fair scheduling policies. Subject to these features a special dynamic programming scheme is proposed to select resources depending on how they fit a particular job execution duration. Based on a conservative backfilling scheduling procedure we study how different resources allocation heuristics affect integral job-flow scheduling characteristics in a dedicated simulation environment.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lee, Y.C., Wang, C., Zomaya, A.Y., Zhou, B.: Profit-driven scheduling for cloud services with data access awareness. J. Parallel Distrib. Comput. 72(4), 591–602 (2012)
Bharathi, S., Chervenak, A.L., Deelman, E., Mehta, G., Su, M., Vahi, K.: Characterization of scientific workflows. In: 2008 Third Workshop on Workflows in Support of Large-Scale Science, pp. 1–10 (2008)
Rodriguez, M.A., Buyya, R.: Scheduling dynamic workloads in multi-tenant scientific workflow as a service platforms. Future Gener. Comput. Syst. 79(P2), 739–750 (2018)
Nazarenko, A., Sukhoroslov, O.: An experimental study of workflow scheduling algorithms for heterogeneous systems. In: Malyshkin, V. (ed.) Parallel Computing Technologies, pp. 327–341. Springer International Publishing (2017)
Netto, M.A.S., Buyya, R.: A flexible resource co-allocation model based on advance reservations with rescheduling support. Technical report, GRIDSTR2007-17, Grid Computing and Distributed Systems Laboratory, The University of Melbourne, Australia, 9 October 2007
Toporkov, V., Yemelyanov, D.: Dependable slot selection algorithms for distributed computing. In: Advances in Intelligent Systems and Computing, vol. 761, pp. 482–491. Springer (2019)
Kurowski, K., Nabrzyski, J., Oleksiak, A., Weglarz, J.: Multicriteria aspects of grid re-source management. In: Nabrzyski, J., Schopf, J.M., Weglarz, J. (eds.) Grid Resource Management. State of the Art and Future Trends, pp. 271–293. Kluwer Academic Publishers (2003)
Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P.: Characterization of Backfilling strategies for parallel job scheduling. In: Proceedings of the International Conference on Parallel Processing, ICPP 2002 Workshops, pp. 514–519 (2002)
Shmueli, E., Feitelson, D.G.: Backfilling with lookahead to optimize the packing of parallel jobs. J. Parallel Distrib. Comput. 65(9), 1090–1107 (2005)
Menasc’e, D.A., Casalicchio, E.: A framework for resource allocation in grid computing. In: The 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS 2004), Volendam, The Netherlands, pp. 259–267 (2004)
Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D., Potekhin, P.: Heuristic strategies for preference-based scheduling in virtual organizations of utility grids. J. Ambient Intell. Humanized Comput. 6(6), 733–740 (2015)
Khemka, B., Machovec, D., Blandin, C., Siegel, H.J., Hariri, S., Louri, A., Tunc, C., Fargo, F., Maciejewski, A.A.: Resource management in heterogeneous parallel computing environments with soft and hard deadlines. In: Proceedings of 11th Metaheuristics International Conference (MIC 2015) (2015)
Calheiros, R.N., Ranjan, R., Beloglazov, A., De Rose, C.A.F., Buyya, R.: CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. J. Softw. Pract. Experience 41(1), 23–50 (2011)
Samimi, P., Teimouri, Y., Mukhtar, M.: A combinatorial double auction resource allocation model in cloud computing. J. Inf. Sci. 357(C), 201–216 (2016)
Rodero, I., Villegas, D., Bobroff, N., Liu, Y., Fong, L., Sadjadi, S.: Enabling interoperability among grid meta-schedulers. J. Grid Comput. 11(2), 311–336 (2013)
Jackson, D., Snell, Q., Clement, M.: Core algorithms of the Maui scheduler. In: Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2001, pp. 87–102 (2001)
Acknowledgments
This work was partially supported by the Council on Grants of the President of the Russian Federation for State Support of Young Scientists (YPhD-2979.2019.9), RFBR (grants 18-07-00456 and 18-07-00534) and by the Ministry on Education and Science of the Russian Federation (project no. 2.9606.2017/8.9).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Toporkov, V., Yemelyanov, D. (2020). Coordinated Resources Allocation for Dependable Scheduling in Distributed Computing. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Engineering in Dependability of Computer Systems and Networks. DepCoS-RELCOMEX 2019. Advances in Intelligent Systems and Computing, vol 987. Springer, Cham. https://doi.org/10.1007/978-3-030-19501-4_51
Download citation
DOI: https://doi.org/10.1007/978-3-030-19501-4_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19500-7
Online ISBN: 978-3-030-19501-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)