Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1316723, author = {Barnat, Jiří and Ročkai, Petr and Štill, Vladimír and Weiser, Jiří}, address = {Neuveden}, booktitle = {Model Checking Software}, doi = {http://dx.doi.org/10.1007/978-3-319-23404-5_5}, editor = {Bernd Fischer, Jaco Geldenhuys}, keywords = {Data Structures; Concurrency; Hash Tables; Model Checking; DIVINE; C++}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Neuveden}, isbn = {978-3-319-23403-8}, pages = {49-65}, publisher = {Springer International Publishing}, title = {Fast, Dynamically-Sized Concurrent Hash Table}, year = {2015} }
TY - JOUR ID - 1316723 AU - Barnat, Jiří - Ročkai, Petr - Štill, Vladimír - Weiser, Jiří PY - 2015 TI - Fast, Dynamically-Sized Concurrent Hash Table PB - Springer International Publishing CY - Neuveden SN - 9783319234038 KW - Data Structures KW - Concurrency KW - Hash Tables KW - Model Checking KW - DIVINE KW - C++ N2 - We present a new design and a C++ implementation of a high-performance, cache-efficient hash table suitable for use in implementation of parallel programs in shared memory. Among the main design criteria were the ability to efficiently use variable-length keys, dynamic table resizing to accommodate data sets of inpredictable size and fully concurrent read-write access. We show that the design is correct with respect to data races, both through a high-level argument, as well as by using a model checker to prove crucial safety properties of the actual implementation. Finally, we provide a number of benchmarks showing the performance characteristics of the C++ implementation, in comparison with both sequential-access and concurrent-access designs. ER -
BARNAT, Jiří, Petr ROČKAI, Vladimír ŠTILL a Jiří WEISER. Fast, Dynamically-Sized Concurrent Hash Table. In Bernd Fischer, Jaco Geldenhuys. \textit{Model Checking Software}. Neuveden: Springer International Publishing, 2015, s.~49-65. ISBN~978-3-319-23403-8. Dostupné z: https://dx.doi.org/10.1007/978-3-319-23404-5\_{}5.
|