Efficient Execution of Real-Time Tasks on a Single Process

This paper presents a scheduling algorithm that maximizes utilization of available processing power and consequently maximizes the throughput of a single processor. The main idea is to distribute all available processing power over the tasks being executed proportional to their workload such that each task can get at least its reserved processing power. If a task received a processing power more than the required value, its execution time reduces and it finishes before its deadline. When a new task arrives, a processor´s processing power is re-distributed among the tasks being executed on this processor to complete their jobs without violating their deadlines. Consequently, a higher workload becomes available for the new arrived task. This gives a higher chance for the new task to be admitted. If the available processing power of the target processor is not enough to accept the new task, but there is enough available workload, a variable processing power is assigned to the arrived task during its execution to allocate the task to the processor without violating its deadline. Experimental results reveal that the proposed approach improves acceptance rate compared to three previous approaches