On Optimizing Running Time of a Time Critical Application in Heterogeneous Distributed Computing

Scheduling of an application that executes in Heterogeneous Distributed Computing is well addressed in the literature. Scheduling task graph in heterogeneous distributed computing is one of the most challenging NP-complete problems. This paper focusses on compile time scheduling of a time critical application with some tasks of the application to meet the deadline. Obviously, the paper presents an effective way to optimize the running time of a time critical application. The approach first schedules the tasks that are precedence to the time critical tasks as well as time critical tasks of an application using an existing efficient heuristic without bothering other non-time critical tasks application. After this non-time critical tasks of the application are scheduled by effectively and efficiently using the idle slots of previous schedule and thus overall running time is optimized.