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

研究成果: Conference contribution

3 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題Proceedings - 5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998
發行者Institute of Electrical and Electronics Engineers Inc.
頁面286-292
頁數7
ISBN(電子)081869209X, 9780818692093
DOIs
出版狀態Published - 1998 1月 1
事件5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998 - Hiroshima, Japan
持續時間: 1998 10月 271998 10月 29

出版系列

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

Other

Other5th International Conference on Real-Time Computing Systems and Applications, RTCSA 1998
國家/地區Japan
城市Hiroshima
期間98-10-2798-10-29

All Science Journal Classification (ASJC) codes

  • 電腦科學應用
  • 軟體

指紋

深入研究「A characterization of re-execution costs for real-time abort-oriented protocols」主題。共同形成了獨特的指紋。

引用此