Amanote Research
Register
Sign In
Supporting Lock-Free Composition of Concurrent Data Objects
doi 10.1145/1787275.1787286
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2010
Authors
Daniel Cederman
Philippas Tsigas
Publisher
ACM Press
Related search
Enabling Lock-Free Concurrent Workers Over Temporal Graphs Composed of Multiple Time-Series
A Methodology for Implementing Highly Concurrent Data Objects
Operating Systems Review (ACM)
Hardware
Computer Networks
Information Systems
Architecture
Communications
Every Data Structure Deserves Lock-Free Memory Reclamation
Proceedings of the ACM on Programming Languages
Incremental Lock Selection for Composite Objects.
Journal of Object Technology
Software
Reimplementation of Lock Free Cuckoo Hashing
Proving Correctness of Highly-Concurrent Linearisable Objects
Axiomatic Characterization of Trace Reachability for Concurrent Objects
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Dynamic Class Construct for Asynchronous Concurrent Objects
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Generative Interface Structure Design for Supporting Existing Objects
