Применение метода английского аукциона при планировании заданий с абсолютными приоритетами в распределенной вычислительной системе

А.В. Баранов, Баранов А.В., Телегин Павел Николаевич et al. · Международный журнал Программные продукты и системы · 2018

The article considers the problem of job scheduling with absolute priorities in a geographically distributed computing system (GDS) when auction methods can be efficiently applied.Most latest papers use a market model where the subject of auction trades (goods) are computational resources, and their owners act as sellers.Buyers are users who participate in the auction to purchase computing resources for of their jobs execution.Such model assumes that customers have certain budgets in nominal or real money.Job priority is determined by the price that the user can pay to finish the job by certain time.The investigated GDS model differs from the known ones by thу fact that job 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 when the subject of auction 468 trades are jobs, and resource owners act as buyers paying for jobs with available free computing resources.Within this approach, the authors consider the English auction as the most preferred method for job scheduling with absolute priorities in GDS.The main characteristic of the scheduling algorithm, which is based on this method, is the duration of an auction.The paper presents experimental evaluation of the optimal duration of the English auction in reference to the average job processing time.

Cited by 2 works. doi:10.15827/0236-235x.123.461-468 Open-access PDF

Authors

References