Mixed locking/abort protocol for hard real-time systems

Lih Chyun Shu, Michal Young

研究成果: Conference contribution

16 引文 斯高帕斯(Scopus)

摘要

The paper discusses a protocol that can address and accommodate analytic guarantees of schedulability, can be implemented with small bounded overheads and blocking and ensure serializable execution of entire tasks including complete read/compute/write cycles. One such protocol which combines locking and abort is described. Its properties include transactions scheduled by locking are never aborted, tasks are aborted only due to conflict with higher priority tasks and cost of abortion can be controlled for the purpose of schedulability analysis.

原文English
主出版物標題Proceedings of the IEEE Workshop on Real-Time Operating Systems and Software
發行者Publ by IEEE
頁面102-106
頁數5
ISBN(列印)0818657103
出版狀態Published - 1994 一月 1
事件Proceedings of the 11th IEEE Workshop on Real-Time Operating Systems and Software - Seattle, WA, USA
持續時間: 1994 五月 181994 五月 19

出版系列

名字Proceedings of the IEEE Workshop on Real-Time Operating Systems and Software

Other

OtherProceedings of the 11th IEEE Workshop on Real-Time Operating Systems and Software
城市Seattle, WA, USA
期間94-05-1894-05-19

    指紋

All Science Journal Classification (ASJC) codes

  • Software

引用此

Shu, L. C., & Young, M. (1994). Mixed locking/abort protocol for hard real-time systems. 於 Proceedings of the IEEE Workshop on Real-Time Operating Systems and Software (頁 102-106). (Proceedings of the IEEE Workshop on Real-Time Operating Systems and Software). Publ by IEEE.