Independent task scheduling in heterogeneous environment via makespan refinery approach

Abstract

Tasks scheduling in heterogeneous computing environments is one of the most challenging problems in distributed computing. The optimally mapping of independent tasks onto heterogeneous distributed computing systems is known to be NP complete problem. This paper addresses a two-stage methodology for solving the independent task scheduling problems in heterogeneous distributed computing. The scheduler aims to minimize the total completion time using the task reassignment strategy. This later uses a new Makespan Refinery Approach (MRA) to improve our initial task scheduling solution by reducing the maximum completion time. The effectiveness of the proposed scheduling method has been tested and evaluated using simulations. The experiment results show the behaviour of the scheduling method for the short completion time of a set of tasks.