Date Added: Jun 2012
Efficient scheduling of computationally intensive program is one of the most essential and most difficult issues to achieve high performance in a parallel computing. Finding an optimal solution for a scheduling problem is NP-complete. Therefore, it is necessary to have heuristic to find a reasonably good schedule. This work focuses on task scheduling (multiprocessor scheduling) keeping in view its significance for the most complex scientific and engineering applications. So, this paper aims at implementing list based scheduling heuristic with different types of task priorities and to test their appropriateness in regards to prominent performance parameters like schedule length, speedup and efficiency.