TY - GEN
T1 - A characterization of re-execution costs for real-time abort-oriented protocols
AU - Shu, Lih Chyun
N1 - Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
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
AN - SCOPUS:84884609103
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.
T2 - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998
Y2 - 27 October 1998 through 29 October 1998
ER -