Abstract
We introduce our major ideas of a wait-free, linearizable, and disjoint access parallel NCAS library, called rtNCAS. It focuses the construction of wait-free data structure operations (DSO) in real-time circumstances. rtNCAS is able to conditionally swap multiple independent words (NCAS) in an atomic manner. It allows us, furthermore, to implement arbitrary DSO by means of their sequential specification.
- M. P. Herlihy. Wait-free synchronization. in ACM Transactions on Programming Languages and Systems, 11(1):124--149, January 1991. Google Scholar
Digital Library
- M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. in ACM Transactions on Programming Languages and Systems, 12(3):463--492, 1990. Google Scholar
Digital Library
- A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. in Proc. of the Symp. on Principles of Distributed Computing, pages 151--160, 1994. Google Scholar
Digital Library
- S. Ramamurthy. A lock-free approach to object sharing in real-time systems. PhD thesis, Univ. of North Carolina at Chapel Hill, 1997. Google Scholar
Digital Library
Index Terms
A wait-free NCAS library for parallel applications with timing constraints
Recommendations
A wait-free NCAS library for parallel applications with timing constraints
PPoPP '11: Proceedings of the 16th ACM symposium on Principles and practice of parallel programmingWe introduce our major ideas of a wait-free, linearizable, and disjoint access parallel NCAS library, called rtNCAS. It focuses the construction of wait-free data structure operations (DSO) in real-time circumstances. rtNCAS is able to conditionally ...
Wait-free linearization with an assertional proof
Given a sequential implementation of an arbitrary data object, a wait-free, linearizable concurrent implementation is constructed with space complexity quadratic in the number of processes. If processes do not concurrently invoke, the amortized time ...
A Wait-Free Hash Map
In this work we present the first design and implementation of a wait-free hash map. Our multiprocessor data structure allows a large number of threads to concurrently insert, get, and remove information. Wait-freedom means that all threads make ...







Comments