Scalable, low complexity, and fast greedy scheduling heuristics for highly heterogeneous distributed computing systems

Cesar O. Diaz, Johnatan E. Pecero, Pascal Bouvry
2013 Journal of Supercomputing  
For heterogeneous distributed computing systems, important design issues are scalability and system optimization. Given such systems, it is crucial to develop low computational complexity algorithms to schedule tasks in a manner that exploits the heterogeneity of the resources and applications. In this paper, we report three scalable, and fast scheduling heuristics for highly heterogeneous distributed computing systems. The heuristics are thoroughly compared with three other heuristics from the
more » ... literature. The benchmarking outlines the performance of the schedulers, representing scalability, schedule length, computational complexity, and memory utilization. The set of experimental results shows that our heuristics perform as efficiently as the related approaches while featuring lower complexity, lower running time, and lower used memory. The experimental results also detail the various scenarios under which certain algorithms excel and fail.
doi:10.1007/s11227-013-1038-0 fatcat:oj6fxypk4rbvlbbmn4txi532pe