Fast, Dynamically-Sized Concurrent Hash Table

Barnat, Jǐŕı; RoăźKai, Petr; Štill, Vladimír; Weiser, Jiří

doi:10.1007/978-3-319-23404-5_5

Cited by 8 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Smaller tests CLHT managed, but was still not able to beat our implementations. We also tried the concunent hash set of DIVINE [19], but it had a similar problem.…”

Section: Namementioning

confidence: 99%

Concurrent Chaining Hash Maps for Software Model Checking

Berg

Pol

2019

2019 Formal Methods in Computer Aided Design (FMCAD)

View full text Add to dashboard Cite

Stateful model checking creates numerous states which need to be stored and checked if already visited. One option for such storage is a hash map and this has been used in many model checkers. In particular, we are interested in the performance of concurrent hash maps for use in multi-core model checkers with a variable state vector size. Previous research claimed that open addressing was the best performing method for the parallel speedup of concurrent hash maps. However, here we demonstrate that chaining lends itself perfectly for use in a concurrent setting.We implemented 12 hash map variants, all aiming at multicore efficiency. 8 of our implementations support variable-length key-value pairs. We compare our implementations and 22 other hash maps by means of an extensive test suite. Of these 34 hash maps, we show the representative performance of 11 hash maps.Our implementations not only support state vectors of variable length, but also feature superior scalability compared with competing hash maps. Our benchmarks show that on 96 cores, our best hash map is between 1.3 and 2.6 times faster than competing hash maps, for a load factor under 1. For higher load factors, it is an order of magnitude faster.

show abstract

“…Smaller tests CLHT managed, but was still not able to beat our implementations. We also tried the concunent hash set of DIVINE [19], but it had a similar problem.…”

Section: Namementioning

confidence: 99%

Concurrent Chaining Hash Maps for Software Model Checking

Berg

Pol

2019

2019 Formal Methods in Computer Aided Design (FMCAD)

View full text Add to dashboard Cite

show abstract

“…All the source code relevant to this paper, along with additional data and other supplementary material is available online. 2…”

Section: Contributionmentioning

confidence: 99%

“…Nonetheless, as our previous work shows [1], a combination of state space reduction techniques, compression and of a tailored approach to test case construction makes model checking a genuinely useful programming aid. For example, we have successfully applied this approach in development of scalable concurrent data structures [2] in C++. permissible for the program to read from a fixed file, in the understanding that the content of the file is treated as part of the program, not as variable (arbitrary) input.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

DiVM: Model checking with LLVM and graph memory

Ročkai

Štill

Černá

et al. 2018

Journal of Systems and Software

View full text Add to dashboard Cite

In this paper, we introduce the concept of a virtual machine with graphorganised memory as a versatile backend for both explicit-state and abstractiondriven verification of software. Our virtual machine uses the LLVM IR as its instruction set, enriched with a small set of hypercalls. We show that the provided hypercalls are sufficient to implement a small operating system, which can then be linked with applications to provide a POSIX-compatible verification environment. Finally, we demonstrate the viability of the approach through a comparison with a more traditionally-designed LLVM model checker.

show abstract

Local Nontermination Detection for Parallel C++ Programs

Štill

Barnat

2019

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Fast, Dynamically-Sized Concurrent Hash Table

Cited by 8 publications

References 7 publications

Concurrent Chaining Hash Maps for Software Model Checking

Concurrent Chaining Hash Maps for Software Model Checking

DiVM: Model checking with LLVM and graph memory

Local Nontermination Detection for Parallel C++ Programs

Contact Info

Product

Resources

About