Expected Completion Time Based Scheduling Algorithm for Heterogeneous Processors

Free registration required

Executive Summary

Effective scheduling of a distributed application is one of the major issues in distributed computing systems since scheduling algorithms are playing important role in achieving better performance. In this paper, the authors proposed a static Expected Completion Time based Scheduling (ECTS) algorithm to effectively schedule application tasks onto the heterogeneous processors. The algorithm is mainly focused on minimizing the application execution time. It consists of two phases: First, the order of execution of tasks is computed in the task prioritization phase and secondly, the ordered tasks are assigned to the available processors in the processor selection phase.

  • Format: PDF
  • Size: 548.7 KB