Scheduling with Heuristic Technique using Parallel Environment

Job of Parallel Processing is to speed-up the execution of a large task by dividing the task into small and multiple sub-tasks that execute concurrently[1][2]. Here each sub task has its own processor for a faster output. By doing so the effectiveness becomes more beneficial for large number of calculations having some constraints like time constraints etc. Scheduling is the crucial step of parallel programming that deals with the assignment of a set of tasks in the parallel system environment and set the execution in such a way that the total execution time is minimized. The proposed technique has the efficient execution of the schedule on parallel system that takes the structure of the application and the performance characteristics. Number of appriximations, heuristics and comparisions have been proposed to fulfill the task scheduling problem. It is well known NP-complete problem (NP-Hard problem) in task scheduling for optimization of the result[3][4]. With a fast heuristic technique known as GA (Genetic Alogrithm), it will be proposed to schedule all the parallel tasks in homogeneous parallel environment having comparision with the First Come First Serve (FCFS), Shortest Job First (SJF) and Round Robin (RR) scheduling? methods. By comaring all the algorithms, optimized result can be evaluated and decision can be done for the best optimized selection.