Semi-Fixed-Priority Scheduling: New Priority Assignment Policy for Practical Imprecise Computation

This paper proposes semi-fixed-priority scheduling to achieve both low-jitter and high schedulability. Semi-fixed-priority scheduling is for the extended imprecise computation model, which has a wind-up part as a second mandatory part and schedules the part of each extended imprecise task with fixed...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications pp. 339 - 348
Main Authors Chishiro, H, Takeda, A, Funaoka, K, Yamasaki, N
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2010
Subjects
Adaptation model
Computational modeling
Interference
Jitter
Processor scheduling
Real time systems
Real-Time Scheduling
Schedules
Semi-Fixed-Priority Scheduling
Online AccessGet full text

Cover

More Information
Summary:This paper proposes semi-fixed-priority scheduling to achieve both low-jitter and high schedulability. Semi-fixed-priority scheduling is for the extended imprecise computation model, which has a wind-up part as a second mandatory part and schedules the part of each extended imprecise task with fixed-priority. This paper also proposes a novel semi-fixed-priority scheduling algorithm based on Rate Monotonic (RM), called Rate Monotonic with Wind-up Part (RMWP). RMWP limits executable ranges of wind-up parts to minimize jitter. The schedulability analysis proves that one task set is feasible by RMWP if the task set is feasible by RM. Simulation results show that RMWP has both lower jitter and higher schedulability than RM.
ISBN:1424484804
9781424484805
ISSN:2325-1271
DOI:10.1109/RTCSA.2010.30