A Modified Task Scheduling Algorithm of Task Graph without Communication Time
The scheduling of tasks on the processors is considered to be a very critical problem in the multiprocessor system. Here, the problem is divided into subtasks and it is assigned on the processors. The overall objective of task scheduling is to minimize the execution time. Considering that the task scheduling is represented by a Directed Acyclic Graph (DAG). In this paper, the authors are proposing an algorithm for task scheduling without communication time while assigning of tasks on the processors.