• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms (1996)

Cached

  • Download as a PDF

Download Links

  • [www.researchgate.net]
  • [www.research.ibm.com]
  • [researchweb.watson.ibm.com]
  • [www.classes.cec.wustl.edu]
  • [www.cs.pdx.edu]
  • [web.cecs.pdx.edu]
  • [web.cecs.pdx.edu]
  • [www.cs.rochester.edu]
  • [ftp.cs.rochester.edu]
  • [wiki.cs.unm.edu]
  • [ftp.cs.rochester.edu]
  • [hypatia.dcs.qmw.ac.uk]
  • [cs.nyu.edu]
  • [www.cogsci.rochester.edu]
  • [www.cs.rochester.edu]
  • [ftp.cs.rochester.edu]
  • [www.cs.rochester.edu]
  • [files.cnblogs.com]
  • [cs.rochester.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Maged M. Michael , Michael L. Scott
Venue:Proc. 15th ACM Symp. on Principles of Distributed Computing
Citations:12 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Michael96simple,fast,,
    author = {Maged M. Michael and Michael L. Scott},
    title = {Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms},
    booktitle = {Proc. 15th ACM Symp. on Principles of Distributed Computing},
    year = {1996},
    pages = {267--275}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed concurrently. Both algorithms are simple, fast, and practical; we were surprised not to find them in the literature. Experiments on a 12-node SGI Challenge multiprocessor indicate that the new non-blocking queue consistently outperforms the best known alternatives; it is the clear algorithm of choice for machines that provide a universal atomic primitive (e.g. compare and swap or load linked/store conditional). The two-lock concurrent queue outperforms a single lock when several processes are competing simultaneously for access; it appears to be the algorithm of choice for busy queues on machines with non-universal atomic primitives (e.g. test and set). Since much of the motivation for non-blocking algorithms is rooted in their immunity to large, unpredictable delays in process execution,we report experimental ...

Keyphrases

practical non-blocking    blocking concurrent queue algorithm    new non-blocking concurrent queue algorithm    single lock    clear algorithm    new twolock queue algorithm    unpredictable delay    non-blocking algorithm    non-universal atomic primitive    two-lock concurrent queue    process execution    12-node sgi challenge multiprocessor indicate    universal atomic primitive    busy queue    known alternative    several process    new non-blocking queue    previous author   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University