Challenges in Real-Time Synchronization

Upcoming multi-core processors force developers of realtime systems to meet the challenges in real-time synchronization. This paper sketches some results of a novel wait-free, linearizable, and disjoint-access parallel NCAS library, called RTNCAS. It focuses the use in massive parallel real-time systems and enables developers to implement arbitrarily complex data structures in an easy way, while ensuring linearizability, wait-freedom, as well as disjoint-access parallelism. It allows, furthermore, developers to re-use their sequential algorithms without any modifications and care about concurrency. Thereby, the degree of disjoint-access parallelism can be used to trade a low jitter for a higher average-case performance.

[1]  Wolfgang Schröder-Preikschat,et al.  A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions , 2009, 2009 IEEE International Symposium on Industrial Embedded Systems.

[2]  Amos Israeli,et al.  Disjoint-access-parallel implementations of strong shared memory primitives , 1994, PODC '94.

[3]  Håkan Sundell.  Wait-free reference counting and memory management , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[4]  David D. Clark,et al.  The structuring of systems using upcalls , 1985, SOSP '85.

[5]  Mark Moir.  Practical implementations of non-blocking synchronization primitives , 1997, PODC '97.

[6]  Maged M. Michael.  ABA Prevention Using Single-Word Instructions , 2004 .

[7]  James H. Anderson,et al.  A lock-free approach to object sharing in real-time systems , 1997 .

[8]  Håkan Sundell.  Wait-Free Multi-Word Compare-and-Swap Using Greedy Helping and Grabbing , 2011, International Journal of Parallel Programming.

[9]  Mark Moir,et al.  Universal Constructions for Large Objects , 1995, IEEE Trans. Parallel Distributed Syst..

[10]  Keir Fraser,et al.  A Practical Multi-word Compare-and-Swap Operation , 2002, DISC.

[11]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[12]  Prasad Jayanti,et al.  A lower bound on the local time complexity of universal constructions , 1998, PODC '98.

[13]  Nir Shavit,et al.  Elimination Trees and the Construction of Pools and Stacks , 1997, Theory of Computing Systems.

[14]  Wolfgang Schröder-Preikschat,et al.  A wait-free NCAS library for parallel applications with timing constraints , 2011, PPoPP '11.

[15]  Keir Fraser,et al.  Practical lock-freedom , 2003 .

[16]  Yi Zhang.  Non-blocking Synchronization: Algorithms and Performance Evaluation , 2003 .

[17]  Lindsay Groves,et al.  Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction , 2008, CATS.

[18]  James H. Anderson,et al.  Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems , 1998, DISC.