Provided by: International Journal of Pure and Applied Research in Engineering and Technology (IJPRET)
Date Added: Apr 2014
In this paper, the authors focus on overview of clock driven, priority-driven and weighted round-robin approaches to scheduling. An algorithm for scheduling hard real time jobs is optimal if it can produce a feasible schedule as long as feasible schedules of the given jobs exist i.e. when system is not overloaded. Another important concept is predictability of the timing behavior of jobs. The execution behavior of system is predictable if system exhibits no anomalies.