ttrie: Contention-free STM hash map
A contention-free STM hash map. "Contention-free" means that the map will never cause spurious conflicts. A transaction operating on the map will only ever have to retry if another transaction is operating on the same key at the same time.
This is an implementation of the transactional trie, which is basically a lock-free concurrent hash trie lifted into STM. For a detailed discussion, including an evaluation of its performance, see Chapter 4 of my master's thesis.
[Skip to Readme]
|Versions [faq]||0.1, 0.1.0.0, 0.1.1, 0.1.2, 0.1.2.1 (info)|
|Dependencies||atomic-primops (>=0.6), base (>=4.7 && <5), hashable (>=1.2), primitive (>=0.5), stm (>=2) [details]|
|Copyright||(c) 2014-2015 Michael Schröder|
|Source repo||head: git clone https://github.com/mcschroeder/ttrie.git|
|Uploaded||by MichaelSchroeder at Sat Nov 7 22:33:36 UTC 2015|
|Distributions||LTSHaskell:0.1.2.1, NixOS:0.1.2.1, Stackage:0.1.2.1|
|Downloads||2206 total (53 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2015-11-13 [all 2 reports]
For package maintainers and hackage trustees