Abstract
The model of geographically distributed computing system with absolute priorities of jobs is described in the paper. Authors designed the decentralized scheduling algorithm using the auction methods. Two auction methods were researched and compared: the first-price sealed-bid auction and the English auction. The paper includes results of experimental comparison of researched auction methods.
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
References
Foster, I.: The physiology of the grid: an open grid services architecture for distributed systems integration. Comput. Netw. Int. J. Comput. Telecommun. Netw. 40(1), 5–17 (2002)
Kovalenko, V.N., Koryagin, D.A.: Organization of Grid resources Keldysh Institute of Applied Mathematics RAS, no. 63, p. 25 (2004)
Khoroshevskii, V.G.: Virtualization architecture of distributed computing systems in Student, Scientist, Teacher. p. 69. Avtograf, Novosibirsk (2015)
Korneev, V.V., Monakhov, O.G.: About allocation of tasks in computer systems with programmable structure in Architecture of computer systems with programmable structure, pp. 3–17. Sobolev Institute of mathematics, Novosibirsk (1982)
Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: Evaluation of job-scheduling strategies for grid computing. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 191–202. Springer, Heidelberg (2000). doi:10.1007/3-540-44444-0_18
Kovalenko, V.N., Kovalenko, E.I., Shorin, O.N.: Development of grid job dispatcher based on lookahead scheduling. Keldysh Institute of Applied Mathematics RAS, Moscow (2005)
Bobchenkov, A.V.: Development of models and management practices in virtual organizations distributed computing systems (in Russian). MPEI, Moscow (2011)
Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic models for resource allocation and scheduling in grid computing. Concurrency Comput. Pract. Exp. 14, 1507–1542 (2002). doi:10.1002/cpe.690
Nabrzyski, J., Schopf, J.M., Weglarz, J.: Grid Resource Management. State of the Art and Future Trends (2003). doi:10.1007/978-1-4615-0509-9
Wolski, R., Plank, J.S., Bryan, T., Brevik, J.: G-commerce: market formulations controlling resource allocation on the computational grid. In: Proceedings of the 15th IEEE International Parallel and Distributed Processing Symposium, April 2000. doi:10.1109/IPDPS.2001.924985
Vazhkudai, S., von Laszewski, G.: A greedy grid - the grid economic engine directive. In: Proceedings of the 15th IEEE International Parallel and Distributed Processing Symposium, April 2000. doi:10.1109/IPDPS.2001.925170
Chen, C., Maheswaran, M., Toulouse, M.: Supporting coallocation in an auctioning-based resource allocator for grid systems. In: Proceedings of the 11th IEEE Heterogeneous Computing Workshop, April 2001. doi:10.1109/IPDPS.2002.1015666
Hurwicz, L.: The design of resource allocation mechanisms. In: Arrow, K., Hurwicz, L. (eds.) Studies in Resource Allocation Processes, pp. 3–38. Cambridge University Press, Cambridge (1977). doi:10.1017/CBO9780511752940.002
Gomoluch, J., Schroeder, M.: Market-based resource allocation for grid computing: a model and simulation. In: Proceedings of the 1st International Workshop on Middleware for Grid Computing, pp. 211–218, June 2003
Grosu, D., Das, A.: Auction-based resource allocation protocols in grids. In: Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 20–27 (2004)
Wolski, R., Plank, J.S., Brevik, J., Bryan, T.: Analyzing market-based resource allocation strategies for the computational grid. Int. J. High Perform. Comput. Appl. 15(3), 258–281 (2001). doi:10.1177/109434200101500305
Vohra, R.V.: Combinatorial auctions. In: Handbook of Game Theory with Economic Applications, vol. 4, pp. 455–476 (2015). doi:10.1016/B978-0-444-53766-9.00008-2
Kale, L.V., Kumar, S., Potnuru, M., DeSouza, J., Bandhakavi, S.: Faucets: efficient resource allocation on the computational grid. In: Proceedings of the International Conference on Parallel Processing (ICPP 2004), pp. 396–405 (2004). doi:10.1109/ICPP.2004.1327948
Baranov, A.V., Tikhomirov, A.I.: Use closed bid auction in a territorially distributed computing system with absolute priorities. In: Proceedings of the NSCF 2016, Pereslavl-Zalessky (2016)
Toporkov, V.V., Emelyanov, D.M., Potehin, P.A.: Job batch generation and scheduling in distributed computing environments. Bulletin of the South Ural State University. Series: Computational Mathematics and Software Engineering, no 2. pp. 21–24 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Baranov, A., Telegin, P., Tikhomirov, A. (2017). Comparison of Auction Methods for Job Scheduling with Absolute Priorities. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2017. Lecture Notes in Computer Science(), vol 10421. Springer, Cham. https://doi.org/10.1007/978-3-319-62932-2_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-62932-2_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62931-5
Online ISBN: 978-3-319-62932-2
eBook Packages: Computer ScienceComputer Science (R0)