An Adaptive Real Time Task Scheduler
Time constraint is the main factor in real time operating system. Different scheduling algorithm is used to schedule the task. The Earliest Deadline First and Ant Colony Optimization is a dynamic scheduling algorithm used in a real time system and it is most beneficial scheduling algorithm for single processor real-time operating systems when the systems are preemptive and under loaded. The main problem in EDF algorithm is that the performance of the system decreases because of overload condition. To solve this problem ACO (Ant Colony Optimization) based scheduling algorithm for real-time operating system is used which assures the overloaded condition. But the ACO algorithm takes more time for completing the task.
The performance of the EDF and ACO is calculated in terms of Success Ratio and Effective CPU Utilization. The goal is to switch automatically between EDF algorithm and ACO based scheduling algorithm to deal overloaded and under loaded conditions.
Keywords: Real-Time Scheduling algorithm, Earliest Deadline First, Ant Colony Optimization, Fixed Priority until zero laxity, Load balancing.
Download Full-Text
ABOUT THE AUTHORS
Jashweeni Nandanwar
Urmila Shravankar
Jashweeni Nandanwar
Urmila Shravankar