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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.