ACO based scheduling method for soft RTOS with simulation and mathematical proofs

Abstract

The Ant Colony Optimization (ACO) algorithm is a mathematical model enlivened by the system searching conduct of ants. By taking a gander at the qualities of ACO, it is most suitable for scheduling of tasks in soft real-time systems. In this paper, the ACO based scheduling method for the soft real-time operating system (RTOS) has been profound with mathematical and practical proof. In Mathematical proof, three different Propositions and two Theorems have been given, which prove the correctness of the proposed algorithm. Practical experiments also support mathematical proofs. During the investigation, observations are gathered with different periodic task set. Algorithms have been observed regarding Success Ratio (SR) and Effective CPU utilization (ECU). ACO based scheduling algorithm has been compared with the Earliest Deadline First (EDF) algorithm with parameter SR and ECU. The EDF is dynamic scheduling algorithm and it is most suitable in RTOS when task set is preemptable. It is noted that the new algorithm is equally efficient during under loaded conditions when CPU load is less than one. ACO based scheduling algorithm performs superior during the overloaded conditions when CPU load is more than one where as EDF algorithm performance degraded in overload condition. Empirical study has been executed with a hefty Dataset consist of more than 7500 task set, and a set contains different one to nine processes where CPU load is dynamic for each process set and differ from 0.5 to 5. Algorithms have been executed on five-hundred-time unit for each process set to authenticate the accuracy of both algorithms.