BAP: a class of abort-oriented protocols based on the notion of compatibility

Ming Chung Liang, Tei Wei Kuo, Lih Chyun Shu

研究成果: Paper

3 引文 斯高帕斯(Scopus)

摘要

There has been growing interest in the performance of transaction systems that have significant response time requirements. These requirements are usually specified as hard or soft deadlines on individual transactions, and a concurrency control algorithm must attempt to meet the deadlines as well as preserve data consistency. This paper proposes a class of simple and efficient abort-oriented concurrency control algorithms based on the notion of compatibility. The schedulability of a transaction system is improved by aborting transactions that introduce excessive blockings. We consider different levels of the aborting relationship among transactions and evaluate the impacts of the aborting relationship when the relationship is built in an on-line or off-line fashion. The strengths of the work is demonstrated by improving the worst-case schedulability of an avionics example [9], a satellite control system [3], and randomly generated transaction sets.

原文English
頁面118-125
頁數8
出版狀態Published - 1996 十二月 1
事件Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications - Seoul, South Korea
持續時間: 1996 十月 301996 十一月 1

Other

OtherProceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications
城市Seoul, South Korea
期間96-10-3096-11-01

    指紋

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

引用此

Liang, M. C., Kuo, T. W., & Shu, L. C. (1996). BAP: a class of abort-oriented protocols based on the notion of compatibility. 118-125. 論文發表於 Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications, Seoul, South Korea, .