Sciweavers

IPPS
2008
IEEE

Portioned static-priority scheduling on multiprocessors

14 years 4 months ago
Portioned static-priority scheduling on multiprocessors
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoretical design of the algorithm is well implementable for practical use. The schedulability of the algorithm is also analyzed to guarantee the worst-case performance. The simulation results show that the algorithm achieves higher system utilizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms.
Shinpei Kato, Nobuyuki Yamasaki
Added 31 May 2010
Updated 31 May 2010
Type Conference
Year 2008
Where IPPS
Authors Shinpei Kato, Nobuyuki Yamasaki
Comments (0)