Efficient processing power utilization to execute real-time tasks

Scheduling real-time applications requires high utilization of the available processing power on processors to accommodate as many tasks as possible while satisfying the required deadlines of the applications. Moreover, an acceptable level of reliability should be provided due to the critical nature of the applications. In this paper, we propose a new approach that highly utilizes the available processing power to improve the admission rate of real-time task scheduling. The basic idea is to use all of the available processing power to execute allocated tasks. This reduces the execution time needed for each task and hence increases its reliability. It also reduces needed processing power for existing tasks to satisfy their deadlines and hence provides higher available processing power for any new task. This gives a higher chance for the new arriving task to be accommodated. We show that our approach is beneficial in that it provides a better scheme with higher acceptance rate for real time tasks compared to the traditional approach of using a fixed processing power reservation