Cited By
View all- Dechev DLaborde PFeldman S(2013)LC/DC: Lockless Containers and Data Concurrency a Novel Nonblocking Container Library for Multicore ApplicationsIEEE Access10.1109/ACCESS.2013.22825001(625-645)Online publication date: 2013
SRC: facilitating efficient parallelization of information storage and retrieval on large data sets
Page 381
Abstract
The purpose of this work is to develop a lock-free hash table that allows a large number of threads to concurrently insert, modify, or retrieve information. Lock-free or non-blocking designs alleviate the problems traditionally associated with lock-based designs, such as bottlenecks and thread safety. Using standard atomic operations provided by the hardware, the design is portable and therefore, applicable to embedded systems and supercomputers such as the Cray XMT. Real-world applications range from search-indexing to computer vision. Having written and tested the core functionality of the hash table, we plan to perform a formal validation using model checkers.
Reference
[1]
Shalev, O., and Shavit, N. 2006. Split-Ordered Lists: Lock-Free Extensible Hash Tables. Journal of the ACM, 53, 3, 379--405.
Index Terms
- SRC: facilitating efficient parallelization of information storage and retrieval on large data sets
Recommendations
A Wait-Free Multi-Word Compare-and-Swap Operation
The number of cores in future multi-core systems are expected to increase by 100 fold over the next decade. The fine-grained synchronization methods found in wait-free algorithm designs makes them desirable for these future systems. Unfortunately, such ...
Lock-free deques and doubly linked lists
We present a practical lock-free shared data structure that efficiently implements the operations of a concurrent deque as well as a general doubly linked list. The implementation supports parallelism for disjoint accesses and uses atomic primitives ...
Fast and lock-free concurrent priority queues for multi-thread systems
We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2011
398 pages
ISBN:9781450301022
DOI:10.1145/1995896
- General Chair:
- David K. Lowenthal,
- Program Chairs:
- Bronis R. de Supinski,
- Sally A. McKee
Copyright © 2011 Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 31 May 2011
Check for updates
Author Tags
Qualifiers
- Poster
Conference
ICS '11
Sponsor:
Acceptance Rates
Overall Acceptance Rate 629 of 2,180 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 120Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)1
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
Cited By
View all- Dechev DLaborde PFeldman S(2013)LC/DC: Lockless Containers and Data Concurrency a Novel Nonblocking Container Library for Multicore ApplicationsIEEE Access10.1109/ACCESS.2013.22825001(625-645)Online publication date: 2013
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in