A wait-free NCAS library for parallel applications with timing constraints
Abstract
References
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 Multi-Word Compare-and-Swap Operation
The number of cores in future multi-core systems are expected to increase by 100 fold over the next decade. The fine-grained synchronization methods found in wait-free algorithm designs makes them desirable for these future systems. Unfortunately, such ...
Comments
Information & Contributors
Information
Published In
February 2011326 pages
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 148Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in