Comparison of Priority-Based and First Price Sealed-Bid Auction Algorithms of Job Scheduling in a Geographically-Distributed Computing System

被引：0

作者：

Shabanov, Boris M. ^{[1
]}

Telegin, Pavel ^{[1
]}

Aladyshev, Oleg S. ^{[1
]}

Baranov, Anton V. ^{[1
]}

Tikhomirov, Artem ^{[1
]}

机构：

[1] Russian Acad Sci, Fed State Inst, Sci Res Inst Syst Anal, Joint Supercomp Ctr, Moscow, Russia

来源：

PROCEEDINGS OF THE 2018 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (EICONRUS) | 2018年

关键词：

distributed computing system; computational jobs with absolute priorities; economic based scheduling; auction based scheduling algorithm; first-price sealed-bid auction;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The paper discusses the problem of scheduling computational jobs in a geographically-distributed computing system with decentralized resource management model. Computational jobs in this model have absolute priorities, and high priority job can interrupt low priority running jobs. Straightforward approach for this problem in this kind of systems is based on the simple priority-based algorithm. Another approach is based on economic scheduling methods; authors consider the first-price sealed-bid auction. The paper presents results of experimental comparison of the two algorithms.

引用

页码：1557 / 1562

页数：6