TY - JOUR
T1 - On avoiding remote blocking via real-time concurrency control protocols
AU - Shu, Lih Chyun
N1 - Funding Information:
This paper is an extended version of a paper appeared in the Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications, 2000. This work was supported, in part, by NSC grants 89-2213-E-309-001 and 90-2745-P-309-003.
PY - 2003/11/15
Y1 - 2003/11/15
N2 - Locking protocols for hard-real-time systems have not generalized well from uniprocessors to multiprocessors. Bounding and reducing so-called "remote blocking" is widely recognized as an important problem for hard-real-time computing. We describe a combination of locking and versioning protocols together with a "chopping" analysis to shorten critical sections. Selective application of chopping and versioning reduces remote blocking and relaxes constraints imposed by pure locking protocols for multiprocessors. Using the same design-time information required for schedulability analysis in pure locking protocols, the integrated locking and versioning protocol can be implemented using only simple data structures with tunable bounded overheads and worst-case access times. Performance evaluation results via case studies and simulation experiments are presented that show that the protocol can improve pure locking protocols in a variety of settings. Experiments show that in some cases the number of tasks that can be guaranteed schedulability by our integrated protocol is 2.5 times more than the number of tasks that can be guaranteed schedulability by pure locking protocols.
AB - Locking protocols for hard-real-time systems have not generalized well from uniprocessors to multiprocessors. Bounding and reducing so-called "remote blocking" is widely recognized as an important problem for hard-real-time computing. We describe a combination of locking and versioning protocols together with a "chopping" analysis to shorten critical sections. Selective application of chopping and versioning reduces remote blocking and relaxes constraints imposed by pure locking protocols for multiprocessors. Using the same design-time information required for schedulability analysis in pure locking protocols, the integrated locking and versioning protocol can be implemented using only simple data structures with tunable bounded overheads and worst-case access times. Performance evaluation results via case studies and simulation experiments are presented that show that the protocol can improve pure locking protocols in a variety of settings. Experiments show that in some cases the number of tasks that can be guaranteed schedulability by our integrated protocol is 2.5 times more than the number of tasks that can be guaranteed schedulability by pure locking protocols.
UR - http://www.scopus.com/inward/record.url?scp=0041328067&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0041328067&partnerID=8YFLogxK
U2 - 10.1016/S0164-1212(02)00143-7
DO - 10.1016/S0164-1212(02)00143-7
M3 - Article
AN - SCOPUS:0041328067
SN - 0164-1212
VL - 68
SP - 121
EP - 136
JO - Journal of Systems and Software
JF - Journal of Systems and Software
IS - 2
ER -