Delayed rate monotonic with semi-partitioned technique adapted to multiprocessors

Abstract

This paper presents a semi-partitioned scheduling algorithm for periodic tasks on multiprocessor platforms. The scheduling policy used within each processor is based on delayed rate monotonic algorithm. Delayed rate monotonic is a modified version of rate monotonic algorithm, which can achieve higher processor utilization than rate monotonic. First, it is formally proved that any task which is feasible under rate monotonic is feasible under delayed rate monotonic, as well. Then, based on delayed rate monotonic, a new scheduling algorithm called adapted delayed rate monotonic (ADRM) is designed for multiprocessor systems. ADRM is composed of delayed rate monotonic algorithm and a semi-partitioned technique. Semi-partitioned is a new approach for allocating tasks on multiprocessor platforms. According to the simulation results, ADRM is safer against possible overload than rate monotonic algorithm. Then, a procedure is proposed to achieve processor utilization under ADRM algorithm more than the rate monotonic algorithm.