A Comparative Study of Scheduling Algorithms for Real Time Task
M. Kaladevi, M. Phil, S. Sathiyabama, K. S. Rangasamy · 2010
The Real Time Operating System (RTOS) supports applications that meet deadlines in addition to providing logically correct results. In multitasking operating system for the applications need to meeting of time deadlines and functioning in real time constraints. To meet the real-time constraints in Real time system for scheduling the task, different scheduling algorithms were used. Most of the real-time systems are designed using priority based preemptive scheduling and worst case execution time estimates to guarantee the execution of high priority tasks. Workstation and personal computers are increasingly used for applications with real time characteristics such us speech understanding and synthesis, media computations and I/O and often concurrently executed with traditional non-real-time workstation. The main objective of this paper is to compare two important task schedulers such as Earliest DeadLine First (EDF) scheduler and Ant Colony Optimization Based (ACO) scheduler. It also presents a system that can be schedule multiple independent tasks. Tasks can obtain minimum guaranteed execution time with its performances.