Abstract
The article describes the problem of scheduling jobs with absolute priorities in a geographically distributed network of supercomputer centers (GDN). In this case English auction method can be efficiently applied. Classic market model considers computational resources as the goods (subject of auction trades), and resources’ owners act as sellers. Users act as buyers who participate in the auction on purpose to purchase computing resources for the execution of their jobs. This model assumes that customers have certain budgets in nominal or real money. The priority of the job is actually determined by the price, which the user can pay to finish the job by a certain time. The GDN model investigated by the authors differs from the known ones in that the jobs priorities are absolute and assigned according to uniform rules. The main goal is the earliest execution of high-priority jobs. In this case, the concept of the user’s budget becomes meaningless, and the classic auction models do not work. The authors propose a new approach where the jobs act as the goods and buyers are resource owners who paying for jobs with available idle supercomputing resources. For this approach, the authors investigate the features and characteristics of English auction, as the most preferred method for scheduling jobs with absolute priorities in GDN.
Similar content being viewed by others
References
B. Shabanov, A. Ovsiannikov, A. Baranov, S. Leshchev, B. Dolgov, and D. Derbyshev, “The distributed network of the supercomputer centers for collaborative research,” Program. Sist.: Teor. Prilozh. 8:4 (35), 245–262 (2017). doi https://doi.org/10.25209/2079-3316-2017-8-4-245-262
R. L. Henderson, “Job scheduling under the portable batch system,” Lect. Notes Comput. Sci. 949, 279–294 (1995). doi https://doi.org/10.1007/3-540-60153-8_34
A. B. Yoo, M. A. Jette, and M. Grondona, “SLURM: simple Linux utility for resource management,” Lect. Notes Comput. Sci. 2862, 44–60 (2003). doi https://doi.org/10.1007/10968987_3
Moab HPC Suite Enterprise Edition. http://www.adaptivecomputing.com/products/hpc-products/moab-hpc-suite-enterprise-edition. Accessed 2018.
SUPPZ. http://suppz.jscc.ru/. Accessed 2018.
A. V. Baranov and A. I. Tikhomirov, “Methods and tools for organizing the global job queue in the geographically distributed computing system,” Vestn. Yuzh. Ural. Univ., Ser.: Vychisl. Mat. Programm. 6 (4), 28–42 (2017). doi https://doi.org/10.14529/cmse17040
K. Kumar Singh, M. Kumar, M. Singhal, and A. Dubey, “Elastic search,” Int. J. Mod. Trends Eng. Res. 5 (5) (2018). doi https://doi.org/10.21884/ijmter.2018.5137.2jz19
G. P. Klimov, Queuing Theory (Mosk. Gos. Univ., Moscow, 2011) [in Russian].
R. Buyya, D. Abramson, J. Giddy, and H. Stockinger, “Economic models for resource allocation and scheduling in grid computing,” Concurrency Comput. Pract. Exp., 1507–1542 (2002). doi https://doi.org/10.1002/cpe.690
R. Wolski, J. S. Plank, and J. Brevik, “Analyzing market-based resource allocation strategies for the computational grid,” High Perform. Comput. Appl. 15, 258–281 (2001). doi https://doi.org/10.1177/109434200101500305
L. V. Kale, S. Kumar, M. Potnuru, J. DeSouza, and S. Bandhakavi, “Faucets: efficient resource allocation on the computational grid,” in Proceedings of the International Conference on Parallel Processing ICPP, Montreal, Quebec, Canada, 2004 (Montreal, Quebec, 2004), pp. 396–405. doi https://doi.org/10.1007/978-3-319-62932-2_37
A. Baranov, P. Telegin, and A. Tikhomirov “Comparison of auction methods for job scheduling with absolute priorities,” Lect. Notes Comput. Sci. 10421, 387–395 (2001). doi https://doi.org/10.1177/109434200101500305
E. S. Wentzel, Probability Theory, Textbook, 12th ed. (Mir, Moscow, 2018).
O. A. Petukhov, A. V. Morozov, and A. V. Petukhova, Modeling: Systemic, Simulation, Analytical, The Handbook (Sev. Zap. Tekhnol. Univ., St. Petersburg, 2008) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
(Submitted by A. M. Elizarov)
Rights and permissions
About this article
Cite this article
Tikhomirov, A.I. The English Auction Method for Scheduling Jobs in a Distributed Network of Supercomputer Centers. Lobachevskii J Math 40, 606–613 (2019). https://doi.org/10.1134/S1995080219050214
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080219050214