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.
Cite
CITATION STYLE
Baranov, A., Telegin, P., & Tikhomirov, A. (2017). Comparison of auction methods for job scheduling with absolute priorities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10421 LNCS, pp. 387–395). Springer Verlag. https://doi.org/10.1007/978-3-319-62932-2_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
