SIGN IN
SIGN UP
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
Full Text:
PDF
Buy this Article
Authors:
Maged M. Michael
Department of Computer Science, University of Rochester, Rochester, NY
Michael L. Scott
Department of Computer Science, University of Rochester, Rochester, NY
Published in:
· Proceeding
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Pages 267-275
ACM
New York, NY
, USA
©1996
table of contents
ISBN:0-89791-800-2
doi>
10.1145/248052.248106
1996 Article
Bibliometrics
· Downloads (6 Weeks): 40
· Downloads (12 Months): 352
· Downloads (cumulative): 1,608
· Citation Count: 138
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
compare_and_swap
concurrent queue
lock-free
multiprogramming
non-blocking
parallelism and concurrency
performance
reliability
sequencing and scheduling
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder