Resource co-allocation algorithms in distributed job batch scheduling

P. 2–20.

Toporkov V. V., Toporkova A. S., Bobchenkov A. V., Yemelyanov D. M.

In this work, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and parallel job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. This work discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.

Keywords: планирование, распределенные вычисления, задание, неотчуждаемость ресурсов, метапланировщик, виртуальные организации, экономические принципы, distributed computing, scheduling, job, non-dedicated recourses, metasheduler, virtual organizations, economic principles

In book

Advances in Information Technology from AI to Virtual Reality

Amman: UbiCC Publisher, 2011.