11 releases (4 breaking)
Uses old Rust 2015
0.5.1 | Nov 18, 2018 |
---|---|
0.5.0 | Nov 17, 2018 |
0.4.1 | Nov 11, 2018 |
0.3.2 | Nov 4, 2018 |
0.1.1 | Jun 15, 2018 |
#252 in Concurrency
26,711 downloads per month
Used in 120 crates
(18 directly)
260KB
5.5K
SLoC
lockfree
Lockfree data structures for Rust.
We currently have:
- Per-Object Thread-Local Storage
- Map
- Set
- Queue
- Stack
- SPSC, MPSC, SPMC and MPMC channels
Documentation for the Lastest Commit
https://bzim.gitlab.io/lockfree/lockfree/
Changelog
See CHANGELOG.md
Contributing
See CONTRIBUTING.md
Benchmarks
See BENCHMARKS.md
C11 Incinerator Implementation
lib.rs
:
A crate providing lock-free data structures and a solution for the "ABA problem" related to pointers.
The incinerator is the API which tries to solve the "ABA problem" when related to pointer dropping. With incinerator, every thread has a local garbage list. Dropping a shared object consist of first removing the pointer from the shared context, then adding the pointer to the garbage list. A "pause counter" is checked. If the counter is zero, then the whole list is deleted, otherwise, the list will only be deleted later.
This counter is counting how many times the incinerator was asked to "pause". A thread may pause the incinerator to load and use the shared pointer, and this is why it is important to remove the pointer from the shared context before deleting. Previous version of lockfree used a global incinerator. Currently, a per-object incinerator is used.
This crate is under development, and there are plans for some structures. We have:
[x]
Per-Object Thread-Local Storage[x]
Channels (SPSC, MPSC, SPMC, MPMC)[x]
Map[x]
Set[x]
Stack[x]
Queue[ ]
Deque
Performance Guide
In order to achieve a better time performance with lockfree, it is recommended to avoid global locking stuff like heap allocation.