Amanote Research
Register
Sign In
Using Elimination to Implement Scalable and Lock-Free FIFO Queues
doi 10.1145/1073970.1074013
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2005
Authors
Mark Moir
Daniel Nussbaum
Ori Shalev
Nir Shavit
Publisher
ACM Press
Related search
Distributed Process Networks — Using Half FIFO Queues in CORBA
Advances in Parallel Computing
Computer Science
Performance, Scalability, and Semantics of Concurrent FIFO Queues
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Extremal Property of FIFO Discipline in G / IFR /1 Queues
Advances in Applied Probability
Applied Mathematics
Statistics
Probability
An Extremal Property of FIFO Discipline in G/Ifr/1 Queues
Advances in Applied Probability
Applied Mathematics
Statistics
Probability
Medium Access Using Queues
Reimplementation of Lock Free Cuckoo Hashing
How to Implement Marketing Strategies Using Database Approaches
Journal of Database Marketing & Customer Strategy Management
Supporting Lock-Free Composition of Concurrent Data Objects
Every Data Structure Deserves Lock-Free Memory Reclamation
Proceedings of the ACM on Programming Languages
