TY - GEN
T1 - Mixed locking/abort protocol for hard real-time systems
AU - Shu, Lih Chyun
AU - Young, Michal
PY - 1994/1/1
Y1 - 1994/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027961164&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027961164&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0027961164
SN - 0818657103
T3 - Proceedings of the IEEE Workshop on Real-Time Operating Systems and Software
SP - 102
EP - 106
BT - Proceedings of the IEEE Workshop on Real-Time Operating Systems and Software
PB - Publ by IEEE
T2 - Proceedings of the 11th IEEE Workshop on Real-Time Operating Systems and Software
Y2 - 18 May 1994 through 19 May 1994
ER -