Real-time object sharing with minimal system support
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Synchronization mechanisms for SCRAMNet+ systems
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Design of a Real-Time SQL Engine in the Distributed Environment
ARTDB '97 Proceedings of the Second International Workshop on Active, Real-Time, and Temporal Database Systems
Improving Wait-Free Algorithms for Interprocess Communication in Embedded Real-Time Systems
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Versioning concurrency control for hard real-time systems
Journal of Systems and Software
On avoiding remote blocking via real-time concurrency control protocols
Journal of Systems and Software
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
A peer-to-peer middleware platform for fault-tolerant, QoS, real-time computing
Proceedings of the 2nd workshop on Middleware-application interaction: affiliated with the DisCoTec federated conferences 2008
On Scalable Synchronization for Distributed Embedded Real-Time Systems
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
Response time analysis of software transactional memory-based distributed real-time systems
Proceedings of the 2009 ACM symposium on Applied Computing
Proceedings of the Conference on Design, Automation and Test in Europe
STM concurrency control for embedded real-time software with tighter time bounds
Proceedings of the 49th Annual Design Automation Conference
STM concurrency control for multicore embedded real-time software: time bounds and tradeoffs
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Towards optimal priority assignments for the transactional event handlers of P-FRP
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Hi-index | 0.00 |
This paper considers the use of lock-free shared objects within hard real-time systems. As the name suggests, lock-free shared objects are distinguished by the fact that they are not locked. As such, they do not give rise to priority inversions, a key advantage over conventional, lock-based object-sharing approaches. Despite this advantage, it is not immediately apparent that lock-free shared objects can be employed if tasks must adhere to strict timing constraints. In particular, lock-free object implementations permit concurrent operations to interfere with each other, and repeated interferences can cause a given operation to take an arbitrarily long time to complete. The main contribution of this paper is to show that such interferences can be bounded by judicious scheduling. This work pertains to periodic, hard real-time tasks that share lock-free objects on a uniprocessor. In the first part of the paper, scheduling conditions are derived for such tasks, for both static and dynamic priority schemes. Based on these conditions, it is formally shown that lock-free object-sharing approaches can be expected to incur much less overhead than approaches based on wait-free objects or lock-based schemes. In the last part of the paper, this conclusion is validated experimentally through work involving a real time desktop videoconferencing system.