A Mapping Heuristic Approach for Scheduling the Tasks on Parallel Multiprocessors

Multiprocessor scheduling is an NP-hard problem, no exact tractable algorithm exist. Many algorithms to schedule DAGs on multiprocessors have been proposed but this paper is an attempt to implement the scheduling algorithm called mapping heuristic of APN class. This paper also gives the scheduling trace of the algorithm which will describe how the tasks are allocated to the different processors with the help of Gantt chart.