Open AccessHPC WORKLOAD BALANCING ALGORITHM FOR CO- SCHEDULING ENVIRONMENTS
Author(s) -
Ruslan Kuchumov,
Vladimir Korkhov
Publication year - 2021
Publication title -
9th international conference "distributed computing and grid technologies in science and education"
Language(s) - English
Resource type - Conference proceedings
DOI - 10.54546/mlit.2021.21.34.001
Subject(s) - computer science , fair share scheduling , queue , fixed priority pre emptive scheduling , scheduling (production processes) , dynamic priority scheduling , rate monotonic scheduling , distributed computing , two level scheduling , workload , earliest deadline first scheduling , round robin scheduling , flow shop scheduling , job shop scheduling , parallel computing , mathematical optimization , computer network , operating system , schedule , quality of service , mathematics
The goal of this research work is to reduce wait time of HPC (high performance computing) applications in schedulers queue by applying a co-scheduling strategy. This strategy allows the execution of more than one task with different non-overlapping requirements for computational resources simultaneously. Co-scheduling strategy reduces task queue wait time and improves utilization of cluster resources when compared to the scheduling strategies that do not allow for parallel task execution on the same machine. We have proposed a method for measuring application processing speed in its run-time, which can be used as a feedback for scheduling strategies. In this work, we have formalized the co-scheduling problem and proposed strategies for solving it. For some strategies we have shown analytically the upper bounds values of their competitive ratios. Besides that for the proposed scheduling strategies we ran numerical experiments using imitation models to show how they compare to the optimal strategy.