Multi-level queue for task scheduling in heterogeneous distributed computing system

In last several years, significant amount of attention has been devoted to task scheduling process in heterogeneous distributed computing system (HDCS). The task scheduling is an important problem, where different tasks are scheduled to target processor in such a way that the overall tasks computation is completed within a shortest possible time. In this paper, we have presented a multi-level queue (MLQ) task scheduling algorithm to minimize the makespan for parallelizing the subtasks without violating the precedence relationships. Here, our main objective is to exploit the advantages of heuristic-based task scheduling algorithms in terms of makespan, time complexity, resource utilization, system throughput and dynamic nature. Our contribution is analyzed and evaluated through experimental results