immortal-queue
Build a Queue-Processing Worker Pool using Immortal (by prikhi)
atomic-counter
Haskell counters that can be safely incremented from multiple threads (by sergv)
| immortal-queue | atomic-counter | |
|---|---|---|
| - | 1 | |
| 3 | 17 | |
| - | - | |
| 0.0 | 5.7 | |
| about 4 years ago | 7 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
immortal-queue
Posts with mentions or reviews of immortal-queue.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning immortal-queue yet.
Tracking mentions began in Dec 2020.
atomic-counter
Posts with mentions or reviews of atomic-counter.
We have used some of these posts to build our list of alternatives
and similar projects.
-
[ANN] atomic-counter package - fast shared mutable cells that can be modified concurrently
For a common use case of multiple threads incrementing a counter it works surprisingly faster that TVar, MVar or ever plain IORef. Even more surprisingly, this counter is a faster single-threaded mutable integer cell than IORef. If you're curious, benchmarks are on github.
What are some alternatives?
When comparing immortal-queue and atomic-counter you can also consider the following projects:
unbounded-delays - Unbounded thread delays and timeouts
async-dejafu - Systematic concurrency testing meets Haskell.
unagi-chan - A haskell library implementing fast and scalable concurrent queues for x86, with a Chan-like API
streamly - High performance, concurrent functional programming abstractions