Slot selection and co-allocation for economic scheduling in distributed computing

Authors:
Victor Toporkov;Alexander Bobchenkov;Anna Toporkova;Alexey Tselishchev;Dmitry Yemelyanov
Affiliations:
Computer Science Department, Moscow Power Engineering Institute, Moscow, Russia;Computer Science Department, Moscow Power Engineering Institute, Moscow, Russia;Moscow State Institute of Electronics and Mathematics, Moscow, Russia;European Organization for Nuclear Research, Geneva, Switzerland;Computer Science Department, Moscow Power Engineering Institute, Moscow, Russia
Venue:
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Year:
2011

Citing 9
Cited 2

Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling

IEEE Transactions on Parallel and Distributed Systems
Core Algorithms of the Maui Scheduler

JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Economic Scheduling in Grid Computing

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Multicriteria aspects of Grid resource management

Grid resource management
Application-Level and Job-Flow Scheduling: An Approach for Achieving Quality of Service in Distributed Computing

PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Safety scheduling strategies in distributed computing

International Journal of Critical Computer-Based Systems
Minimizing Execution Costs when Using Globally Distributed Cloud Services

AINA '10 Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
Scheduling parallel applications on utility grids: time and cost trade-off management

ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Scalable co-scheduling strategies in distributed computing

AICCSA '10 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010

Packet task processing in distributed computational environments with inalienable resources

Automation and Remote Control
Economic model of scheduling and fair resource sharing in distributed computations

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, 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 job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. A launch of a parallel job requires a co-allocation of a specified number of slots. 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 paper 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.