JCSE, vol. 8, no. 1, pp.43-56, March, 2014

DOI: http://dx.doi.org/10.5626/JCSE.2014.8.1.43

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

Saeed Senobary, Mahmoud Naghibzadeh
Imam Reza International University, Mashhad, Iran / Dept. of Computer Engineering, Ferdowsi University of Mashhad, Mashhad, Iran

Abstract: Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SSDRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.

Keyword: Real-time systems; Scheduling algorithms; Delayed rate monotonic; Semi-partitioned technique

Full Paper:   169 Downloads, 2354 View