A wait-free NCAS library for parallel applications with timing constraints

Authors:
Philippe Stellwag;Fabian Scheler;Jakob Krainz;Wolfgang Schröder-Preikschat
Affiliations:
Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany;Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany;Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany;Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany
Venue:
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Year:
2011

Citing 4
Cited 0

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Disjoint-access-parallel implementations of strong shared memory primitives

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A lock-free approach to object sharing in real-time systems

A lock-free approach to object sharing in real-time systems

Quantified Score

Hi-index	0.00

Visualization

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.