Wait-free object-sharing schemes for real-time uniprocessors and multiprocessors

被引：8

作者：

Anderson, JH ^{[1
]}

Jain, R ^{[1
]}

Ramamurthy, S ^{[1
]}

机构：

[1] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA

来源：

18TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS | 1997年

关键词：

D O I：

10.1109/REAL.1997.641274

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Several new wait-free object-sharing schemes for realtime uniprocessors and multiprocessors are presented. These schemes have characteristics in common with the priority inheritance and priority ceiling protocols, but are nonblocking and implemented at the user level, In total, six new object-sharing schemes are proposed: two for uniprocessors and four for multiprocessors. Breakdown utilization experiments are presented that show that the multiprocessor schemes entail less overhead than lock-based schemes.

引用

页码：111 / 122

页数：12