A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Supporting lock-free synchronization in Pfair-scheduled real-time systems
2006
Journal of Parallel and Distributed Computing
We consider the use of lock-free techniques for implementing shared objects in real-time Pfair-scheduled multiprocessor systems. Lockfree objects are more economical than locking techniques when implementing relatively simple objects such as buffers, stacks, queues, and lists. However, the use of such objects on real-time multiprocessors is generally considered impractical due to the need for analytical realtime guarantees. In this paper, we explain how the quantum-based nature of Pfair
doi:10.1016/j.jpdc.2005.06.011
fatcat:4xuexyks4ve27nilgq2mobxt5q