Filters








771 Hits in 3.3 sec

Lock-Free Resizeable Concurrent Tries [chapter]

Aleksandar Prokopec, Phil Bagwell, Martin Odersky
2013 Lecture Notes in Computer Science  
A pseudocode for these operations is presented and a proof of correctness is given we show that the implementation is linearizable and lock-free.  ...  Finally, benchmarks are presented that compare concurrent hash trie operations against the corresponding operations on other concurrent data structures.  ...  Its performance is comparable to that of the similar concurrent data structures. The data structure grows dynamically it uses no locks and there is no resizing phase.  ... 
doi:10.1007/978-3-642-36036-7_11 fatcat:mslyonkobverzlgihksn5hejn4

Lock-free Concurrent Level Hashing for Persistent Memory

Zhangyu Chen, Yu Huang, Bo Ding, Pengfei Zuo
2020 USENIX Annual Technical Conference  
For concurrency control, atomic primitives are leveraged to enable lock-free search/insertion/update/deletion.  ...  In order to address the lock contention for concurrent hashing indexes in PM, we propose clevel hashing, a lock-free concurrent level hashing, to deliver high performance with crash consistency.  ...  In order to address the bottleneck of resizing, we propose a dynamic multi-level structure and concurrent resizing without blocking other threads. • Lock-free Concurrency Control.  ... 
dblp:conf/usenix/ChenHDZ20 fatcat:itf5br7ikbflzc3ny4antkytdi

One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory

Pengfei Zuo, Jiazhao Sun, Liu Yang, Shuangwu Zhang, Yu Hua
2021 USENIX Annual Technical Conference  
in the memory pool in a lock-free manner.  ...  To support remote concurrent access with high performance, RACE hashing leverages a lock-free remote concurrency control scheme to enable different clients to concurrently operate the same hashing index  ...  are concurrently executed in a lock-free manner.  ... 
dblp:conf/usenix/ZuoSYZ021 fatcat:rhowodewtrf4zgqqjcwpx6awqa

An Efficient Wait-free Resizable Hash Table

Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars
2018 Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18  
To achieve high throughput at large core counts, our algorithm is specifically designed to retain the natural parallelism of concurrent hashing, while providing wait-free resizing.  ...  An extensive evaluation of our hash table shows that in the common case where resizing actions are rare, our implementation outperforms all existing lock-free hash table implementations while providing  ...  We evaluate our algorithm experimentally and compare it with that of two state-of-the-art lock-free concurrent hash tables: the lock-free resizable hash table proposed by Liu et al.  ... 
doi:10.1145/3210377.3210408 dblp:conf/spaa/FatourouKR18 fatcat:6j2bmj3fjnbuvnatsvckzafzzy

Views

Brian Demsky, Patrick Lam
2010 Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - ICSE '10  
We present views, a new approach to controlling concurrency. Fine-grained locking is often necessary to increase concurrency.  ...  Correctly implementing fine-grained locking with today's concurrency primitives can be challengingrace conditions often plague programs with sophisticated locking schemes.  ...  We would like to thank the anonymous reviewers for their helpful comments and attention to detail, especially with respect to the resize() implementation of the Vector class.  ... 
doi:10.1145/1806799.1806858 dblp:conf/icse/DemskyL10 fatcat:csi55ezcergnfb6j4atghxa5ni

Concurrent tries with efficient non-blocking snapshots

Aleksandar Prokopec, Nathan Grasso Bronson, Phil Bagwell, Martin Odersky
2012 Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming - PPoPP '12  
We show how to implement an efficient lock-free snapshot operation for concurrent hash tries. The snapshot operation uses a single-word compare-and-swap and avoids copying the data structure eagerly.  ...  The hash trie supports standard mutable lock-free operations such as insertion, removal, lookup and their conditional variants.  ...  While the individual concurrent hash table operations such as insertion or removal can be performed in a lock-free manner as shown by Maged [17] , resizing is typically implemented with a global lock.  ... 
doi:10.1145/2145816.2145836 dblp:conf/ppopp/ProkopecBBO12 fatcat:qgifwoagj5fgrndkdsb6e6ham4

Cache-Aware Lock-Free Concurrent Hash Tries [article]

Aleksandar Prokopec, Phil Bagwell, Martin Odersky
2017 arXiv   pre-print
A pseudocode for these operations is presented and a proof of correctness is given -- we show that the implementation is linearizable and lock-free.  ...  Finally, benchmarks are presented which compare concurrent hash trie operations against the corresponding operations on other concurrent data structures, showing their performance and scalability.  ...  While the individual concurrent hash table operations such as insertion or removal can be performed in a lock-free manner as shown by Maged [4] , resizing is typically implemented with a global lock.  ... 
arXiv:1709.06056v1 fatcat:qyudvjylwzds3akqfhmmowjs3y

Split-ordered lists

Ori Shalev, Nir Shavit
2003 Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03  
We present the first lock-free implementation of an extensible hash table running on current architectures.  ...  , the new algorithm performs as well as the most efficient known lock-based resizable hash-table algorithm, and in high load cases it significantly outperforms it.  ...  THE LOCK-FREE RESIZING PROBLEM. What is it that makes lock-free extensible hashing hard to achieve?  ... 
doi:10.1145/872035.872049 dblp:conf/podc/ShalevS03 fatcat:btqmh35udjbrnhsxtkogdgiztm

Split-ordered lists

Ori Shalev, Nir Shavit
2006 Journal of the ACM  
We present the first lock-free implementation of an extensible hash table running on current architectures.  ...  , the new algorithm performs as well as the most efficient known lock-based resizable hash-table algorithm, and in high load cases it significantly outperforms it.  ...  THE LOCK-FREE RESIZING PROBLEM. What is it that makes lock-free extensible hashing hard to achieve?  ... 
doi:10.1145/1147954.1147958 fatcat:wlxsm2rrj5aqphgcxl3nbvksuy

A Conflict-Resilient Lock-Free Calendar Queue for Scalable Share-Everything PDES Platforms

Romolo Marotta, Mauro Ianni, Alessandro Pellegrini, Francesco Quaglia
2017 Proceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation - SIGSIM-PADS '17  
These platforms require efficient event pool data structures enabling high concurrency of extraction/insertion operations.  ...  However, the classical non-blocking paradigm leads concurrent conflicting operations, acting on a same portion of the event pool data structure, to abort and then retry.  ...  However, it does not provide a lock-free scheme for the dynamical resize of the bucket width.  ... 
doi:10.1145/3064911.3064926 dblp:conf/pads/MarottaI0Q17 fatcat:qjmv5ggcxve5fjvuvmrdxt2ife

A Lock-Free O(1) Event Pool and Its Application to Share-Everything PDES Platforms

Romolo Marotta, Mauro Ianni, Alessandro Pellegrini, Francesco Quaglia
2016 2016 IEEE/ACM 20th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)  
In this article we present a lock-free event pool which also provides amortized O(1) time complexity for both insertions and extractions.  ...  It can sustain highly concurrent accesses, while not leading to noticeable performance degradation when scaling up the thread count.  ...  THE LOCK-FREE O(1) EVENT POOL Our lock-free event-pool data structure is inspired to the Calendar Queue [7] . It is a non-blocking priority queue whose schematization is shown in Figure 1 .  ... 
doi:10.1109/ds-rt.2016.33 dblp:conf/dsrt/MarottaI0Q16 fatcat:ezm24oppjrdhfkn6rdb2lbf7x4

Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory

Pengfei Zuo, Yu Hua, Jie Wu
2018 USENIX Symposium on Operating Systems Design and Implementation  
To guarantee the consistency with low overhead, level hashing leverages log-free consistency schemes for insertion, deletion, and resizing operations, and an opportunistic log-free scheme for update operation  ...  of rehashed buckets and improving the resizing performance.  ...  We then present the (opportunistic) log-free schemes ( §3.3) to reduce the consistency overhead. We finally present the concurrent level hashing leveraging fine-grained locking ( §3.4).  ... 
dblp:conf/osdi/Zuo0W18 fatcat:6bbzatawnfgejgct7oblktsf4y

Views

Brian Demsky, Patrick Lam
2013 ACM Transactions on Software Engineering and Methodology  
It locks the first component lock in the list, waiting until this lock becomes available. It then tries to lock the remaining component locks without blocking.  ...  In our example, merging views write, resize and resize would prevent the resize method from running concurrently with the get method.  ... 
doi:10.1145/2430536.2430538 fatcat:ud6jq3qe6fdhhachtf2ll7lmj4

Helper locks for fork-join parallel programming

Kunal Agrawal, Charles E. Leiserson, Jim Sukha
2010 SIGPLAN notices  
We used this prototype to implement a concurrent hash table with a resize operation protected by a helper lock.  ...  If another processor p ′ tries to acquire L, then instead of blocking and waiting for p to complete A, processor p ′ joins p to help it complete A.  ...  For example, the code in Figure 2 uses a reader/writer lock to implement a resizable concurrent hash table.  ... 
doi:10.1145/1837853.1693487 fatcat:dcomvoclajghni7zwe3rtdaqju

Helper locks for fork-join parallel programming

Kunal Agrawal, Charles E. Leiserson, Jim Sukha
2010 Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '10  
We used this prototype to implement a concurrent hash table with a resize operation protected by a helper lock.  ...  If another processor p ′ tries to acquire L, then instead of blocking and waiting for p to complete A, processor p ′ joins p to help it complete A.  ...  For example, the code in Figure 2 uses a reader/writer lock to implement a resizable concurrent hash table.  ... 
doi:10.1145/1693453.1693487 dblp:conf/ppopp/AgrawalLS10 fatcat:wsr4vkzkvbc5vepfwzmeyx6xn4
« Previous Showing results 1 — 15 out of 771 results