Comparative Study of Scheduling Algorithms for Real Time Environment

Abstract

ABSTRACT:Scheduling is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but also on the time at which results are produced. Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in a real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters. Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done. The various issues have been presented on which there is still a need to work.

Scheduling Algorithms Implementation for Real Time Operating Systems: A Review

“…Scheduler and dispatcher are used to do this. It is a decisionmaking process that involves allocating similar resources across several activities and time periods in order to accomplish many goals [85].…”

“…In real-time systems, the most crucial parameter is the deadline, which is defined as the time where the results should be supplied. As seen below, there are three unique types of timeline [85,87].…”

Performance of Dynamic Queue Based Minimal Deadline First Scheduling Algorithm In Multicore System Under Real Time And Non-Real Time Kernel Environment

“…The priority is allocated to each task during compilation time in static priority scheduling, whereas the priority of each task is resolved during run time in dynamic priority scheduling. Rate Monotonic (RM) and Deadline Monotonic (DM) scheduling are instances of static priority scheduling and Minimal Deadline First (MDF) and Least Laxity Time (LLT) are the dynamic priority scheduling scheme [15].…”