Mixed locking/abort protocol for hard real-time systems

Lih Chyun Shu, Michal Young

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

16 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the IEEE Workshop on Real-Time Operating Systems and Software
PublisherPubl by IEEE
Pages102-106
Number of pages5
ISBN (Print)0818657103
Publication statusPublished - 1994 Jan 1
EventProceedings of the 11th IEEE Workshop on Real-Time Operating Systems and Software - Seattle, WA, USA
Duration: 1994 May 181994 May 19

Publication series

NameProceedings 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
CitySeattle, WA, USA
Period94-05-1894-05-19

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software

Cite this

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