SIGN IN
SIGN UP
Wait-free queues with multiple enqueuers and dequeuers
Full Text:
PDF
Buy this Article
Authors:
Alex Kogan
Technion, Haifa, Israel
Erez Petrank
Department of Computer Science, Haifa, Israel
Published in:
· Proceeding
PPoPP '11
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Pages 223-234
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0119-0
doi>
10.1145/1941553.1941585
2011 Article
Bibliometrics
· Downloads (6 Weeks): 38
· Downloads (12 Months): 287
· Downloads (cumulative): 505
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PPoPP '14
Share:
|
Tags:
algorithms
concurrent programming structures
concurrent queues
lists, stacks, and queues
performance
wait-free algorithms
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