An efficient dynamic scheduling algorithm for periodic tasks in real-time systems using dynamic average estimation

Author(s):  
Ahmed Alsheikhy ◽  
Reda Ammar ◽  
Raafat Elfouly ◽  
Mosleh Alharthi ◽  
Abdulrahman Alshegaifi
2016 ◽  
Vol 27 (2) ◽  
Author(s):  
Ahmed Alsheikhy ◽  
Raafat Elfouly ◽  
Mosleh Alharthi ◽  
Reda Ammar ◽  
Abdulrahman Alshegaifi

2011 ◽  
Vol 3 (3) ◽  
pp. 20-30 ◽  
Author(s):  
Apurva Shah ◽  
Ketan Kotecha

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor real-time systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the results of Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is very efficient in underloaded conditions and it performs very well during overloaded conditions also. Moreover, the proposed algorithm can schedule some typical instances successfully which are not possible to schedule using EDF algorithm.


Sign in / Sign up

Export Citation Format

Share Document