Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets

Hiroyuki Chishiro, Nobuyuki Yamasaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Real-time systems such as humanoid robots require low jitter and high Quality of Service (QoS). An imprecise computation is one of the solutions to improve QoS but dynamic-priority imprecise real-time scheduling has high jitter. Semi-fixed-priority scheduling was presented to achieve low jitter and high QoS. Unfortunately, a semi-fixed-priority scheduling algorithm, called Rate Monotonic with Wind-up Part (RMWP), has usually high jitter if the actual case execution time (ACET) of each task is shorter than its worst case execution time (WCET). We propose a new semi-fixedpriority scheduling algorithm, called Rate Monotonic with Wind-up Part++ (RMWP++), to achieve the zero-jitter of each task with harmonic periodic task sets. The zero-jitter technique adds the previous and post optional parts to the extended imprecise computation model that has a second mandatory (wind-up) part. We prove that the jitter of each task in RMWP++ is always zero and the least upper bound of RMWP++ is one with harmonic periodic task sets on uniprocessors. Simulation results show that RMWP++ achieves the zero-jitter and has the smaller number of context switches than RMWP, if the ACET of each task is shorter than its WCET.

Original languageEnglish
Title of host publicationProceedings of the 30th International Conference on Computers and Their Applications, CATA 2015
PublisherThe International Society for Computers and Their Applications (ISCA)
Pages371-378
Number of pages8
ISBN (Print)9781880843987
Publication statusPublished - 2015
Event30th International Conference on Computers and Their Applications, CATA 2015 - Honolulu, United States
Duration: 2015 Mar 92015 Mar 11

Other

Other30th International Conference on Computers and Their Applications, CATA 2015
CountryUnited States
CityHonolulu
Period15/3/915/3/11

Fingerprint

Jitter
Scheduling
Quality of service
Scheduling algorithms
Real time systems
Switches
Robots

Keywords

  • Imprecise computation
  • Jitter
  • Schedulability
  • Semi-fixed-priority scheduling

ASJC Scopus subject areas

  • Computer Science Applications

Cite this

Chishiro, H., & Yamasaki, N. (2015). Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets. In Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015 (pp. 371-378). The International Society for Computers and Their Applications (ISCA).

Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets. / Chishiro, Hiroyuki; Yamasaki, Nobuyuki.

Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015. The International Society for Computers and Their Applications (ISCA), 2015. p. 371-378.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chishiro, H & Yamasaki, N 2015, Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets. in Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015. The International Society for Computers and Their Applications (ISCA), pp. 371-378, 30th International Conference on Computers and Their Applications, CATA 2015, Honolulu, United States, 15/3/9.
Chishiro H, Yamasaki N. Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets. In Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015. The International Society for Computers and Their Applications (ISCA). 2015. p. 371-378
Chishiro, Hiroyuki ; Yamasaki, Nobuyuki. / Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets. Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015. The International Society for Computers and Their Applications (ISCA), 2015. pp. 371-378
@inproceedings{0b8462e863c742e8a962279a43b4f6bf,
title = "Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets",
abstract = "Real-time systems such as humanoid robots require low jitter and high Quality of Service (QoS). An imprecise computation is one of the solutions to improve QoS but dynamic-priority imprecise real-time scheduling has high jitter. Semi-fixed-priority scheduling was presented to achieve low jitter and high QoS. Unfortunately, a semi-fixed-priority scheduling algorithm, called Rate Monotonic with Wind-up Part (RMWP), has usually high jitter if the actual case execution time (ACET) of each task is shorter than its worst case execution time (WCET). We propose a new semi-fixedpriority scheduling algorithm, called Rate Monotonic with Wind-up Part++ (RMWP++), to achieve the zero-jitter of each task with harmonic periodic task sets. The zero-jitter technique adds the previous and post optional parts to the extended imprecise computation model that has a second mandatory (wind-up) part. We prove that the jitter of each task in RMWP++ is always zero and the least upper bound of RMWP++ is one with harmonic periodic task sets on uniprocessors. Simulation results show that RMWP++ achieves the zero-jitter and has the smaller number of context switches than RMWP, if the ACET of each task is shorter than its WCET.",
keywords = "Imprecise computation, Jitter, Schedulability, Semi-fixed-priority scheduling",
author = "Hiroyuki Chishiro and Nobuyuki Yamasaki",
year = "2015",
language = "English",
isbn = "9781880843987",
pages = "371--378",
booktitle = "Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015",
publisher = "The International Society for Computers and Their Applications (ISCA)",

}

TY - GEN

T1 - Zero-jitter technique for semi-fixed-priority scheduling with harmonic periodic task sets

AU - Chishiro, Hiroyuki

AU - Yamasaki, Nobuyuki

PY - 2015

Y1 - 2015

N2 - Real-time systems such as humanoid robots require low jitter and high Quality of Service (QoS). An imprecise computation is one of the solutions to improve QoS but dynamic-priority imprecise real-time scheduling has high jitter. Semi-fixed-priority scheduling was presented to achieve low jitter and high QoS. Unfortunately, a semi-fixed-priority scheduling algorithm, called Rate Monotonic with Wind-up Part (RMWP), has usually high jitter if the actual case execution time (ACET) of each task is shorter than its worst case execution time (WCET). We propose a new semi-fixedpriority scheduling algorithm, called Rate Monotonic with Wind-up Part++ (RMWP++), to achieve the zero-jitter of each task with harmonic periodic task sets. The zero-jitter technique adds the previous and post optional parts to the extended imprecise computation model that has a second mandatory (wind-up) part. We prove that the jitter of each task in RMWP++ is always zero and the least upper bound of RMWP++ is one with harmonic periodic task sets on uniprocessors. Simulation results show that RMWP++ achieves the zero-jitter and has the smaller number of context switches than RMWP, if the ACET of each task is shorter than its WCET.

AB - Real-time systems such as humanoid robots require low jitter and high Quality of Service (QoS). An imprecise computation is one of the solutions to improve QoS but dynamic-priority imprecise real-time scheduling has high jitter. Semi-fixed-priority scheduling was presented to achieve low jitter and high QoS. Unfortunately, a semi-fixed-priority scheduling algorithm, called Rate Monotonic with Wind-up Part (RMWP), has usually high jitter if the actual case execution time (ACET) of each task is shorter than its worst case execution time (WCET). We propose a new semi-fixedpriority scheduling algorithm, called Rate Monotonic with Wind-up Part++ (RMWP++), to achieve the zero-jitter of each task with harmonic periodic task sets. The zero-jitter technique adds the previous and post optional parts to the extended imprecise computation model that has a second mandatory (wind-up) part. We prove that the jitter of each task in RMWP++ is always zero and the least upper bound of RMWP++ is one with harmonic periodic task sets on uniprocessors. Simulation results show that RMWP++ achieves the zero-jitter and has the smaller number of context switches than RMWP, if the ACET of each task is shorter than its WCET.

KW - Imprecise computation

KW - Jitter

KW - Schedulability

KW - Semi-fixed-priority scheduling

UR - http://www.scopus.com/inward/record.url?scp=84925938874&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84925938874&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84925938874

SN - 9781880843987

SP - 371

EP - 378

BT - Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015

PB - The International Society for Computers and Their Applications (ISCA)

ER -