7 releases (4 breaking)
0.5.0 | May 9, 2024 |
---|---|
0.4.0 | Aug 23, 2023 |
0.3.0 | Aug 21, 2023 |
0.2.0 | Feb 10, 2023 |
0.1.1 | Mar 25, 2022 |
#187 in Concurrency
174 downloads per month
60KB
1.5K
SLoC
STM
async-stm
is an implementation of Software Transactional Memory.
It was originally inspired by rust-stm,
but does things sligly differently, in a more traditional fashion.
It was also extended in the following ways:
- Made
atomically
asynchronous, so STM operations can be used withtokio
without blocking a full thread. - Added the ability to
abort
a transaction with an error, which the caller has to handle. - The transaction is passed around in a thread-local variable, for a simplified
TVar
API. - Reading a
TVar
returns anArc
, so cloning can be delayed until we have to modify the result. - Added the option to pass in an auxiliary transaction that gets committed or rolled back together with the STM transaction, and can also cause a retry if it detects some conflict of its own. This is a potential way to have a hybrid persistent STM solution.
- Added some optional queue implementations based on Simon Marlow's book, Parallel and Concurrent Programming in Haskell.
Please look at the tests for example usage.
Prerequisites
Install the following to be be able to build the project:
curl https://sh.rustup.rs -sSf | sh
rustup toolchain install nightly
rustup default stable
rustup update
Benchmarks
There are benchmarks included to help compare the tradeoffs between the different queue implementations.
cargo +nightly bench "bench" --all-features
See more
- https://www.microsoft.com/en-us/research/publication/beautiful-concurrency/
- https://bartoszmilewski.com/2010/09/11/beyond-locks-software-transactional-memory/
License
This project is licensed under the MIT license.
Dependencies
~2.4–8MB
~58K SLoC