Effective Slot Selection and Co-allocation Algorithms for Economic Scheduling in Distributed Computing

Abstract

In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non- dedicated resources. The job launch requires a co-allocation of a specified number of slots starting synchronously. The challenge is that slots associated with different CPU nodes of distributed computational environments may have arbitrary start and finish points that do not match. Some existing algorithms assign a job to the first set of slots matching the resource request without any optimization (the first fit type), while other algorithms are based on an exhaustive search. The novelty of the proposed approach consists of allocating alternative sets of slots. It provides possibilities to optimize job scheduling.