Filters








2,116 Hits in 8.2 sec

Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations [article]

Aleksandar Prokopec
2017 arXiv   pre-print
However, operations on most existing concurrent hash tries run in O(log n) time.  ...  In this technical report, we extend the standard concurrent hash-tries with an auxiliary data structure called a cache.  ...  A Complexity Analysis In this section, we show that the expected execution time of the cache-trie operations is O(1).  ... 
arXiv:1712.09636v1 fatcat:7g5e6u3lbzeixhhgayexpljj3y

A Lock-Free Hash Trie Design for Concurrent Tabled Logic Programs

Miguel Areias, Ricardo Rocha
2015 International journal of parallel programming  
In this work, we present a simpler and efficient lock-free design based on hash tries that minimizes these problems by dispersing the concurrent areas as much as possible.  ...  In previous work, we have presented a sophisticated lock-free design where both levels of the tries where shared among threads in a concurrent environment.  ...  Conclusions We have presented a novel, simple and efficient lock-free design for concurrent tabling environments based on hash tries.  ... 
doi:10.1007/s10766-014-0346-1 fatcat:jpymmvxwvfenlollc6ko44mina

Towards a Lock-Free, Fixed Size and Persistent Hash Map Design

Miguel Joao Goncalves Areias, Ricardo Jorge Gomes Lopes da Rocha
2017 2017 29th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)  
Hash tries are a trie-based data structure with nearly ideal characteristics for the implementation of hash maps.  ...  To the best of our knowledge, our proposal is the first concurrent hash map design that puts together the following characteristics: (i) be lock-free; (ii) use fixed size data structures; and (iii) maintain  ...  PERFORMANCE ANALYSIS This section presents experimental results comparing our proposal with other state-of-the-art concurrent hash map designs.  ... 
doi:10.1109/sbac-pad.2017.26 dblp:conf/sbac-pad/AreiasR17 fatcat:n5mhu2mgnvgvnheja6awemh6sy

One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory

Pengfei Zuo, Jiazhao Sun, Liu Yang, Shuangwu Zhang, Yu Hua
2021 USENIX Annual Technical Conference  
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  ...  To provide efficient indexing services in disaggregated memory scenarios, this paper proposes RACE hashing, a one-sided RDMA-Conscious Extendible hashing index with lock-free remote concurrency control  ...  All index requests are executed by using only one-sided RDMA verbs with constant worst-case time complexity. IDU requests do not cause any extra data movement. • Lock-free remote concurrency control.  ... 
dblp:conf/usenix/ZuoSYZ021 fatcat:rhowodewtrf4zgqqjcwpx6awqa

Concurrent transformation components using contention context sensors

Erik Österlund, Welf Löwe
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
The contribution of this paper is a component architecture that combines the benefits of different synchronization mechanisms to implement thread-safe concurrent components.  ...  We implemented this architecture for concurrent queues, sets, and ordered sets. In all three cases, experimental evaluation shows close to optimal performance regardless of the actual contention.  ...  The burden got worse with the advent of lock-free components.  ... 
doi:10.1145/2642937.2642995 dblp:conf/kbse/OsterlundL14 fatcat:hnngcccecvedpo47wb3enhzyue

Mercury

Rohan Gandhi, Aayush Gupta, Anna Povzner, Wendy Belluomini, Tim Kaldewey
2013 Proceedings of the 6th International Systems and Storage Conference on - SYSTOR '13  
We implement these principles with a simple hash table with linked-list based chaining, and provide high concurrency with a fine-grained, cache-friendly locking scheme.  ...  On a commodity single-socket server with 12 cores, Mercury scales with number of cores and executes 14 times more queries/second than a popular hash-based key-value system, Memcached, for both read and  ...  For analysis, we use the current state-of-the-art tree implementation from MassTree [17] . MassTree combines B + trees and tries, where every trie node is a B + tree.  ... 
doi:10.1145/2485732.2485746 dblp:conf/systor/GandhiGPBK13 fatcat:ax7hz36djngw5piihpaeb62alm

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  
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  ...  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.  ...  The authors would like to thank Darko Petrović and André Schiper for following the initial stages of this work and providing feedback.  ... 
doi:10.1145/3210377.3210408 dblp:conf/spaa/FatourouKR18 fatcat:6j2bmj3fjnbuvnatsvckzafzzy

Analysing the Performance of GPU Hash Tables for State Space Exploration

Nathan Cassee, Anton Wijs
2017 Electronic Proceedings in Theoretical Computer Science  
As a large number of states is discovered and stored during such an exploration, the hash table should be able to quickly handle many inserts and queries concurrently.  ...  We conclude that Cuckoo hashing is three times faster than GPUexplore hashing for random data, and that Cuckoo hashing is five to nine times faster for non-random data.  ...  If all free slots in a bucket have been tried unsuccessfully, or if the bucket had no free slots in the first place, the algorithm hashes the vector with the next hash function h 2 and probes the bucket  ... 
doi:10.4204/eptcs.263.1 fatcat:yiadvlazavdwpkeez7v5fgh4ie

Concurrent Hash Tables: Fast and General?(!) [article]

Tobias Maier, Peter Sanders, Roman Dementiev
2016 arXiv   pre-print
Concurrent hash tables are one of the most important concurrent data structures with numerous applications.  ...  Our starting point for better performing data structures is a fast and simple lock-free concurrent hash table based on linear probing that is limited to word-sized key-value types and does not support  ...  Sequential hash tables support the insertion of elements, and finding, updating, or deleting an element with given key -all of this in constant expected time.  ... 
arXiv:1601.04017v2 fatcat:2da2yt5ze5bvhnzygjhb74t47a

Recipe

Se Kwon Lee, Jayashree Mohan, Sanidhya Kashyap, Taesoo Kim, Vijay Chidambaram
2019 Proceedings of the 27th ACM Symposium on Operating Systems Principles - SOSP '19  
The main insight behind Recipe is that isolation provided by a certain class of concurrent in-memory indexes can be translated with small changes to crash-consistency when the same index is used in PM.  ...  Based on these conditions and conversion actions, we modify five different DRAM indexes based on B+ trees, tries, radix trees, and hash tables to their crash-consistent PM counterparts.  ...  Acknowledgments We would like to thank our shepherd, Peter Chen, the anonymous reviewers, and members of Systems and Storage Lab and LASR group for their feedback and guidance. We are also  ... 
doi:10.1145/3341301.3359635 dblp:conf/sosp/LeeMKKC19 fatcat:gxbpwvv7tnecfaorv7wyv7tx2i

Performance evaluation of adaptivity in software transactional memory

Mathias Payer, Thomas R. Gross
2011 (IEEE ISPASS) IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE  
Comparing adaptSTM and the adaptation system to TL2 results in an average speedup of 43% for 8 threads and 137% for 16 threads. adaptSTM offers performance that is competitive with tinySTM for low-contention  ...  The system adapts different important parameters like write-set hash-size, hash-function, and write strategy based on runtime statistics on a per-thread basis.  ...  An analysis using Valgrind [19] and the callgrind tool shows for the Bayes benchmark that malloc and free consume more than 40% of the time.  ... 
doi:10.1109/ispass.2011.5762733 dblp:conf/ispass/PayerG11 fatcat:li2njaoblffl3bm4iywavl7gfi

Elastic transactions

Pascal Felber, Vincent Gramoli, Rachid Guerraoui
2017 Journal of Parallel and Distributed Computing  
They also exhibit competitive performance compared to lock-based techniques and are much simpler to program with than lock-free alternatives. $ A preliminary extended abstract of this work has been published  ...  We present the elastic transaction model and an implementation of it, then we illustrate its simplicity and performance on various concurrent data structures, namely double-ended queue, hash table, linked  ...  pointing out results on the topic of relative atomicity.  ... 
doi:10.1016/j.jpdc.2016.10.010 fatcat:tanoigl42jhyhdhjutdkcy75fy

Elastic Transactions [chapter]

Pascal Felber, Vincent Gramoli, Rachid Guerraoui
2009 Lecture Notes in Computer Science  
They also exhibit competitive performance compared to lock-based techniques and are much simpler to program with than lock-free alternatives. $ A preliminary extended abstract of this work has been published  ...  We present the elastic transaction model and an implementation of it, then we illustrate its simplicity and performance on various concurrent data structures, namely double-ended queue, hash table, linked  ...  pointing out results on the topic of relative atomicity.  ... 
doi:10.1007/978-3-642-04355-0_12 fatcat:zwx4uz4g7ngd7icnvguae5by4q

Table space designs for implicit and explicit concurrent tabled evaluation

MIGUEL AREIAS, RICARDO ROCHA
2018 Theory and Practice of Logic Programming  
We also motivate for the advantages of using fixed-size and lock-free data structures, elaborate on the key role that the engine's memory allocator plays on such environments, and discuss how Yap's mode-directed  ...  Tabling is a powerful implementation technique that overcomes some limitations of traditional Prolog systems in dealing with recursion and redundant sub-computations.  ...  Memory Allocating and freeing data structures are constant-time operations, because they require only moving a structure to or from a list of free structures.  ... 
doi:10.1017/s147106841800039x fatcat:3td3yqt65raatdbyilqcwttkbi

Phase-concurrent hash tables for determinism

Julian Shun, Guy E. Blelloch
2014 Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14  
We present a deterministic phase-concurrent hash table in which operations of the same type are allowed to proceed concurrently, but operations of different types are not.  ...  times faster on random integer keys when operations are restricted to be phase-concurrent.  ...  [11] describe lock-free hash tables with open addressing. For deletions, Gao et al.'  ... 
doi:10.1145/2612669.2612687 dblp:conf/spaa/ShunB14 fatcat:ywjhokjs6zd3rllzk5uiive6b4
« Previous Showing results 1 — 15 out of 2,116 results