Implementation of a lock-free dictionary on .Net
Lock-free, wait-free implementation of a dictionary.
- has the same API as System.Collections.Concurrent.ConcurrentDictionary.
- No locks are taken during any operation including Get, Add, Remove, internal resizes etc...
- While multiple threads accessing NonBlocking dictionary will help each other in operations such as table resizing, there is no dependency on such behavior. If any thread get unscheduled or delayed for whatever reason, other threads will be able to make progress independently.
- NonBlocking dictionary scales linearly with the number of active threads if hardware permits.
On most operations NonBlocking dictionary is faster than Concurrent, especially in write-heavy scenarios.
There is a subtle difference in the behavior of Remove. Concurrent dictionary removes both the value and the key on Remove, while holding a lock. NonBlocking dictionary only removes values, thus avoiding locking, and the corresponding key is released lazily when more space is needed. In code that relies on deterministic release of key objects (uncommon), Concurrent dictionary would be preferable.
Core algorithms are based on NonBlockingHashMap, written and released to the public domain by Dr. Cliff Click. A good overview could be found here: https://www.youtube.com/watch?v=HJ-719EGIts
Low-overhead scalable counters.
Install-Package NonBlocking -Version 1.0.3
dotnet add package NonBlocking --version 1.0.3
<PackageReference Include="NonBlocking" Version="1.0.3" />
paket add NonBlocking --version 1.0.3
Some performance improvements.
This package is not used by any popular GitHub repositories.