In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources. A single slot is a time span that can be assigned to a task, which is a part of a parallel job. The job launch requires a co-allocation of a specified number of slots starting and finishing synchronously. Some existing resource co-allocation 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. In this paper, algorithms for efficient and dependable slot selection are studied and compared with known approaches. The novelty of the proposed approach is in a general algorithm efficiently selecting a set of slots according to the specified criterion.
CITATION STYLE
Toporkov, V., Toporkova, A., & Yemelyanov, D. (2018). Slot co-allocation optimization in distributed computing with heterogeneous resources. In Studies in Computational Intelligence (Vol. 798, pp. 40–49). Springer Verlag. https://doi.org/10.1007/978-3-319-99626-4_4
Mendeley helps you to discover research relevant for your work.