John D. Valois  Home/Search
Context Related
| rpi.edu/pub/valoisj/tr9417.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study practical techniques for implementing the FIFO queue abstract data type using lock-free data structures, which synchronize the operations of concurrent processes without the use of mutual exclusion. Two new algorithms based on linked lists and arrays are presented. We also propose a new solution to the ABA problem associated with the Compare&Swap instruction. The performance of our linked list algorithm is compared several other lock-free queue implementations, as well as more... (Update)
Cited by: More
Allocating Memory in a Lock-Free Manner - Gidenstam, Papatriantafilou.. (2004) (Correct)
Ecient Almost Wait-free Parallel Accessible Dynamic Hashtables - Gao Groote Hesselink (2004) (Correct)
Almost Wait-free Resizable Hashtables - Gao Department Of (Correct)
Active bibliography (related documents): More All
0.7: Non-Blocking Algorithms and Preemption-Safe Locking on.. - Michael, Scott (1998) (Correct)
0.7: Simple, Fast, and Practical Non-Blocking and Blocking.. - Michael, Scott (1996) (Correct)
0.6: Analysis of Optimistic Concurrency Control Revisited - Johnson (1992) (Correct)
Similar documents based on text: More All
0.2: Fast and Scalable Priority Queue Architecture for High-Speed.. - Bhagwan, Lin (2000) (Correct)
0.1: Real-Time Computing with Lock-Free Shared Objects - Anderson, Ramamurthy, Jeffay (1995) (Correct)
0.1: A Framework for Implementing Objects and Scheduling Tasks.. - Anderson, Ramamurthy (1996) (Correct)
Related documents from co-citation: More All
15: A methodology for implementing highly concurrent data objects - Herlihy - 1993
10: Lock-free Linked Lists using Compare-and-swap - Valois - 1995
10: Linearizability: A correctness condition for concurrent objects (context) - Herlihy, Wing - 1992
BibTeX entry: (Update)
J. D. Valois. Implementing Lock-Free Queues. In Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV, October 1994. http://citeseer.ist.psu.edu/valois94implementing.html More
@inproceedings{ valois94implementing,
author = "J. D. Valois",
title = "Implementing Lock-Free Queues",
booktitle = "Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems",
address = "Las Vegas, NV",
pages = "64--69",
year = "1994",
url = "citeseer.ist.psu.edu/valois94implementing.html" }
Citations (may not include all citations):326 Linearizability: A correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
239 Algorithms for scalable synchronization on shared-memory mul.. (context) - Mellor-Crummey, Scott - 1991
186 A methodology for implementing highly concurrent data struct.. - Herlihy - 1990
150 Proteus: A high-performance parallel-architecture simulator - Brewer, Dellarocas et al. - 1992
113 Computer Architecture and Parallel Processing (context) - Hwang, Briggs - 1985
83 Basic techniques for the efficient coordination of very larg.. - Gottlieb, Lubachevsky et al. - 1983
61 A lock-free multiprocessor OS kernel - Massalin, Pu - 1991
51 Axioms for concurrent objects (context) - Herlihy, Wing - 1987
36 Wait-free parallel algorithms for the union-find problem - Anderson, Woll - 1991
32 Sticky bits and universality of consensus (context) - Plotkin - 1989
31 Rensselaer Polytechnic Institute (context) - Valois
24 A non-blocking algorithm for shared queues using compare-and.. (context) - Prakash, Lee et al. - 1991
21 Watson Research Center (context) - IBM - 1983
18 Lock-free garbage collection for multiprocessors (context) - Herlihy, Moss - 1991
17 Systems programming: Coping with parallelism (context) - Treiber - 1986
13 Efficient wait-free implementation of a concurrent priority .. (context) - Israeli, Rappoport - 1993
11 A library of concurrent objects and their proofs of correctn.. - Wing, Gong - 1990
9 Non-blocking algorithms for concurrent data structures - Prakash, Lee et al. - 1991
8 A simple and correct shared-queue algorithm using Compare-an.. (context) - Stone - 1990
5 Problem-heap: A paradigm for multiprocessor algorithms (context) - Moller-Nielsen, Staunstrup - 1987
4 Operating systems and computer architecture (context) - Sites - 1980
3 Resilient Computation in the Presence of Slowdowns (context) - Turek - 1991
2 Concurrent queues: Practical fetch-and-OE algorithms (context) - Mellor-Crummey - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.rpi.edu.html): More
ILP-Based Scheduling with Time and Resource Constraints in.. - Chaudhuri, Walker (1994) (Correct)
Rationale for Adding Hash Tables to the C++ Standard Template.. - Musser (1995) (Correct)
Adaptive Local Refinement with Octree.. - Flaherty, Loy.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC