A characterization of re-execution costs for real-time abort-oriented protocols

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

3 Citations (Scopus)

Abstract

Abort-oriented protocols for hard real-time systems were proposed mainly to cope with the situation when block-at-most-once property provided by pure locking protocols such as priority ceiling protocol and stack resource protocol is incapable of scheduling a given transaction set due to excessive blocking. The underlying principle is to abort a transaction if it causes other higher-priority transactions unschedulable due to excessive blocking. By aborting the lower-priority transaction, what we gain is reduced blocking for higher-priority transactions, but what we must pay for is to re-execute the aborted lower-priority transaction. To guarantee schedulability for the whole transaction set, we must put an upper bound on the re-execution costs. In this paper, we use a tree-structured transaction framework adapted from Chakravarthy et al. (1998) and we roll back aborted transactions partially in an attempt to more accurately characterize and to reduce re-execution costs for aborted transactions.

Original languageEnglish
Title of host publicationProceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages286-292
Number of pages7
ISBN (Electronic)081869209X, 9780818692093
DOIs
Publication statusPublished - 1998 Jan 1
Event5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998 - Hiroshima, Japan
Duration: 1998 Oct 271998 Oct 29

Publication series

NameProceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998
Volume1998-October

Other

Other5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998
CountryJapan
CityHiroshima
Period98-10-2798-10-29

Fingerprint

Ceilings
Real time systems
Costs
Scheduling

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Cite this

Shu, L-C. (1998). A characterization of re-execution costs for real-time abort-oriented protocols. In Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998 (pp. 286-292). [726429] (Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998; Vol. 1998-October). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/RTCSA.1998.726429
Shu, Lih-Chyun. / A characterization of re-execution costs for real-time abort-oriented protocols. Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998. Institute of Electrical and Electronics Engineers Inc., 1998. pp. 286-292 (Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998).
@inproceedings{a977b11bebfb45fbb3a5dadfdaf0966e,
title = "A characterization of re-execution costs for real-time abort-oriented protocols",
abstract = "Abort-oriented protocols for hard real-time systems were proposed mainly to cope with the situation when block-at-most-once property provided by pure locking protocols such as priority ceiling protocol and stack resource protocol is incapable of scheduling a given transaction set due to excessive blocking. The underlying principle is to abort a transaction if it causes other higher-priority transactions unschedulable due to excessive blocking. By aborting the lower-priority transaction, what we gain is reduced blocking for higher-priority transactions, but what we must pay for is to re-execute the aborted lower-priority transaction. To guarantee schedulability for the whole transaction set, we must put an upper bound on the re-execution costs. In this paper, we use a tree-structured transaction framework adapted from Chakravarthy et al. (1998) and we roll back aborted transactions partially in an attempt to more accurately characterize and to reduce re-execution costs for aborted transactions.",
author = "Lih-Chyun Shu",
year = "1998",
month = "1",
day = "1",
doi = "10.1109/RTCSA.1998.726429",
language = "English",
series = "Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "286--292",
booktitle = "Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998",
address = "United States",

}

Shu, L-C 1998, A characterization of re-execution costs for real-time abort-oriented protocols. in Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998., 726429, Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998, vol. 1998-October, Institute of Electrical and Electronics Engineers Inc., pp. 286-292, 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998, Hiroshima, Japan, 98-10-27. https://doi.org/10.1109/RTCSA.1998.726429

A characterization of re-execution costs for real-time abort-oriented protocols. / Shu, Lih-Chyun.

Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998. Institute of Electrical and Electronics Engineers Inc., 1998. p. 286-292 726429 (Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998; Vol. 1998-October).

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

TY - GEN

T1 - A characterization of re-execution costs for real-time abort-oriented protocols

AU - Shu, Lih-Chyun

PY - 1998/1/1

Y1 - 1998/1/1

N2 - Abort-oriented protocols for hard real-time systems were proposed mainly to cope with the situation when block-at-most-once property provided by pure locking protocols such as priority ceiling protocol and stack resource protocol is incapable of scheduling a given transaction set due to excessive blocking. The underlying principle is to abort a transaction if it causes other higher-priority transactions unschedulable due to excessive blocking. By aborting the lower-priority transaction, what we gain is reduced blocking for higher-priority transactions, but what we must pay for is to re-execute the aborted lower-priority transaction. To guarantee schedulability for the whole transaction set, we must put an upper bound on the re-execution costs. In this paper, we use a tree-structured transaction framework adapted from Chakravarthy et al. (1998) and we roll back aborted transactions partially in an attempt to more accurately characterize and to reduce re-execution costs for aborted transactions.

AB - Abort-oriented protocols for hard real-time systems were proposed mainly to cope with the situation when block-at-most-once property provided by pure locking protocols such as priority ceiling protocol and stack resource protocol is incapable of scheduling a given transaction set due to excessive blocking. The underlying principle is to abort a transaction if it causes other higher-priority transactions unschedulable due to excessive blocking. By aborting the lower-priority transaction, what we gain is reduced blocking for higher-priority transactions, but what we must pay for is to re-execute the aborted lower-priority transaction. To guarantee schedulability for the whole transaction set, we must put an upper bound on the re-execution costs. In this paper, we use a tree-structured transaction framework adapted from Chakravarthy et al. (1998) and we roll back aborted transactions partially in an attempt to more accurately characterize and to reduce re-execution costs for aborted transactions.

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

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

U2 - 10.1109/RTCSA.1998.726429

DO - 10.1109/RTCSA.1998.726429

M3 - Conference contribution

T3 - Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998

SP - 286

EP - 292

BT - Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Shu L-C. A characterization of re-execution costs for real-time abort-oriented protocols. In Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998. Institute of Electrical and Electronics Engineers Inc. 1998. p. 286-292. 726429. (Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998). https://doi.org/10.1109/RTCSA.1998.726429