Split-ordered lists: lock-free extensible hash tables

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Ori Shalev Tel-Aviv University
Nir Shavit Tel-Aviv University
Published in:
Cover Image
 
· Proceeding
PODC '03 Proceedings of the twenty-second annual symposium on Principles of distributed computing
Pages 102-111
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-708-7 doi>10.1145/872035.872049
Split-ordered lists: lock-free extensible hash tables Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 37
· Downloads (cumulative): 1,028
· Citation Count: 8


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder