#lock-free #atomic #data-structures #shared-ptr #thread-local-storage

no-std lock_freedom

This crate provides concurrent data structures and a solution to the ABA problem as an alternative of hazard pointers

1 unstable release

0.1.0 Jul 11, 2023

#908 in Concurrency

MIT license

265KB
5K SLoC

lock_freedom

A fork of the 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

https://gitlab.com/bzim/c11-incinerator/


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:

Performance Guide

In order to achieve a better time performance with lockfree, it is recommended to avoid global locking stuff like heap allocation.

Dependencies