Min-heap-based scheduling algorithm: an approximation algorithm for homogeneous and heterogeneous distributed systems

摘要

One of the most important issues in the design of distributed systems is process scheduling, which maps applications to resources in an attempt to reduce the application execution time or maximise resource utilisation. The complexity involved in finding good scheduling solutions has motivated the design of several heuristics and approximation algorithms. Although heuristics aim at finding good solutions within acceptable time constraints, they do not guarantee solution quality. On the other hand, approximation-based algorithms provide optimal solution bounds, but they are usually designed to address simple scenarios. In an attempt to combine the best of both algorithmic approaches, this paper proposes the min-heap-based scheduling algorithm (MHSA), which finds solutions for homogeneous and heterogeneous distributed environments within acceptable time constraints and optimal solution bounds. MHSA considers applications that can be bag-of-tasks or which communicate among each other. Such solutions minimise the application execution time and maximise resource utilisation; therefore, MHSA is a system-oriented scheduling algorithm. Results confirm that MHSA provides better solutions than schedulers such as Random, Round-Robin, Workload-Queue and List-Scheduling. In addition, MHSA provides an α-approximation ratio for reaching optimal solution bounds.