Semi-fixed-priority scheduling with multiple mandatory parts

Hiroyuki Chishiro, Nobuyuki Yamasaki

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

5 Citations (Scopus)

Abstract

An imprecise computation model has the advantage of supporting overloaded conditions in dynamic real-time environments, compared to Liu and Layland's model. However, the imprecise computation model is not practical because the termination of each optional part cannot guarantee the schedulability. In order to guarantee the schedulability of the termination of the optional part, a practical imprecise computation model is presented. In the practical imprecise computation model, each task has multiple mandatory parts and optional parts to support many imprecise real-time applications. The practical imprecise computation model is supported by dynamic-priority scheduling on uniprocessors. Unfortunately, dynamic-priority scheduling is difficult to support multiprocessors. In contrast, semifixed-priority scheduling, which is part-level fixed-priority scheduling, supports only two mandatory parts so that supported imprecise real-time applications are restricted. This paper presents semi-fixed-priority scheduling with multiple mandatory parts on uniprocessors and multiprocessors respectively. In addition, this paper explains how to calculate the optional deadline of each task, which is the termination time of optional part. The schedulability analysis shows that semi-fixed-priority scheduling strictly dominates fixed-priority scheduling. Thanks to semi-fixed-priority scheduling with multiple mandatory parts, many imprecise realtime applications can be supported.

Original languageEnglish
Title of host publication16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781479921119
DOIs
Publication statusPublished - 2014 Sep 29
Event16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013 - Paderborn, Germany
Duration: 2013 Jun 192013 Jun 21

Other

Other16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013
CountryGermany
CityPaderborn
Period13/6/1913/6/21

Fingerprint

Scheduling
Termination
Real-time
Multiprocessor
Schedulability Analysis
Task Model
Model
Deadline
Strictly
Calculate

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Theoretical Computer Science

Cite this

Chishiro, H., & Yamasaki, N. (2014). Semi-fixed-priority scheduling with multiple mandatory parts. In 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013 [6913216] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISORC.2013.6913216

Semi-fixed-priority scheduling with multiple mandatory parts. / Chishiro, Hiroyuki; Yamasaki, Nobuyuki.

16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013. Institute of Electrical and Electronics Engineers Inc., 2014. 6913216.

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

Chishiro, H & Yamasaki, N 2014, Semi-fixed-priority scheduling with multiple mandatory parts. in 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013., 6913216, Institute of Electrical and Electronics Engineers Inc., 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013, Paderborn, Germany, 13/6/19. https://doi.org/10.1109/ISORC.2013.6913216
Chishiro H, Yamasaki N. Semi-fixed-priority scheduling with multiple mandatory parts. In 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013. Institute of Electrical and Electronics Engineers Inc. 2014. 6913216 https://doi.org/10.1109/ISORC.2013.6913216
Chishiro, Hiroyuki ; Yamasaki, Nobuyuki. / Semi-fixed-priority scheduling with multiple mandatory parts. 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013. Institute of Electrical and Electronics Engineers Inc., 2014.
@inproceedings{d572f3402e29459584f5f65f149da5a2,
title = "Semi-fixed-priority scheduling with multiple mandatory parts",
abstract = "An imprecise computation model has the advantage of supporting overloaded conditions in dynamic real-time environments, compared to Liu and Layland's model. However, the imprecise computation model is not practical because the termination of each optional part cannot guarantee the schedulability. In order to guarantee the schedulability of the termination of the optional part, a practical imprecise computation model is presented. In the practical imprecise computation model, each task has multiple mandatory parts and optional parts to support many imprecise real-time applications. The practical imprecise computation model is supported by dynamic-priority scheduling on uniprocessors. Unfortunately, dynamic-priority scheduling is difficult to support multiprocessors. In contrast, semifixed-priority scheduling, which is part-level fixed-priority scheduling, supports only two mandatory parts so that supported imprecise real-time applications are restricted. This paper presents semi-fixed-priority scheduling with multiple mandatory parts on uniprocessors and multiprocessors respectively. In addition, this paper explains how to calculate the optional deadline of each task, which is the termination time of optional part. The schedulability analysis shows that semi-fixed-priority scheduling strictly dominates fixed-priority scheduling. Thanks to semi-fixed-priority scheduling with multiple mandatory parts, many imprecise realtime applications can be supported.",
author = "Hiroyuki Chishiro and Nobuyuki Yamasaki",
year = "2014",
month = "9",
day = "29",
doi = "10.1109/ISORC.2013.6913216",
language = "English",
isbn = "9781479921119",
booktitle = "16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Semi-fixed-priority scheduling with multiple mandatory parts

AU - Chishiro, Hiroyuki

AU - Yamasaki, Nobuyuki

PY - 2014/9/29

Y1 - 2014/9/29

N2 - An imprecise computation model has the advantage of supporting overloaded conditions in dynamic real-time environments, compared to Liu and Layland's model. However, the imprecise computation model is not practical because the termination of each optional part cannot guarantee the schedulability. In order to guarantee the schedulability of the termination of the optional part, a practical imprecise computation model is presented. In the practical imprecise computation model, each task has multiple mandatory parts and optional parts to support many imprecise real-time applications. The practical imprecise computation model is supported by dynamic-priority scheduling on uniprocessors. Unfortunately, dynamic-priority scheduling is difficult to support multiprocessors. In contrast, semifixed-priority scheduling, which is part-level fixed-priority scheduling, supports only two mandatory parts so that supported imprecise real-time applications are restricted. This paper presents semi-fixed-priority scheduling with multiple mandatory parts on uniprocessors and multiprocessors respectively. In addition, this paper explains how to calculate the optional deadline of each task, which is the termination time of optional part. The schedulability analysis shows that semi-fixed-priority scheduling strictly dominates fixed-priority scheduling. Thanks to semi-fixed-priority scheduling with multiple mandatory parts, many imprecise realtime applications can be supported.

AB - An imprecise computation model has the advantage of supporting overloaded conditions in dynamic real-time environments, compared to Liu and Layland's model. However, the imprecise computation model is not practical because the termination of each optional part cannot guarantee the schedulability. In order to guarantee the schedulability of the termination of the optional part, a practical imprecise computation model is presented. In the practical imprecise computation model, each task has multiple mandatory parts and optional parts to support many imprecise real-time applications. The practical imprecise computation model is supported by dynamic-priority scheduling on uniprocessors. Unfortunately, dynamic-priority scheduling is difficult to support multiprocessors. In contrast, semifixed-priority scheduling, which is part-level fixed-priority scheduling, supports only two mandatory parts so that supported imprecise real-time applications are restricted. This paper presents semi-fixed-priority scheduling with multiple mandatory parts on uniprocessors and multiprocessors respectively. In addition, this paper explains how to calculate the optional deadline of each task, which is the termination time of optional part. The schedulability analysis shows that semi-fixed-priority scheduling strictly dominates fixed-priority scheduling. Thanks to semi-fixed-priority scheduling with multiple mandatory parts, many imprecise realtime applications can be supported.

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

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

U2 - 10.1109/ISORC.2013.6913216

DO - 10.1109/ISORC.2013.6913216

M3 - Conference contribution

AN - SCOPUS:84910066018

SN - 9781479921119

BT - 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013

PB - Institute of Electrical and Electronics Engineers Inc.

ER -