SaaSHub helps you find the best software and product alternatives Learn more →
Zap Alternatives
Similar projects and alternatives to zap
-
zig
General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
-
-
SonarQube
Static code analysis for 29 languages.. Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.
-
tokio
A runtime for writing reliable asynchronous applications with Rust. Provides I/O, networking, scheduling, timers, ...
-
-
-
-
-
InfluxDB
Access the most powerful time series database as a service. Ingest, store, & analyze all types of time series data in a fully-managed, purpose-built database. Keep data forever with low-cost storage and superior data compression.
-
-
ponyc
:horse: Pony is an open-source, actor-model, capabilities-secure, high performance programming language
-
zig-riscv-embedded
Experimental Zig-based CoAP node for the HiFive1 RISC-V board
-
-
differential-datalog
An in-memory incremental Datalog engine based on Differential Dataflow (by Kixiron)
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a better zap alternative or higher similarity.
zap reviews and mentions
Posts with mentions or reviews of zap.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-09-13.
-
Resource efficient Thread Pools (with Zig)
It is a well-written post on an effective implementation of thread pools — an active area of Rust development — including benchmarks that suggest it may be faster than some of our most popular crates in the area.
-
Lock-free, allocation-free, efficient thread pool
This actually can be at the level of a missed optimization. A run queue with a lock-shared queue amongs all the threads scales even worse than the tokio version. Sharding the run queues and changing the notification algorithm, even while keeping locks on the sharded queues improves throughput drastically.
Tokio is an async runtime, but I don't see why being an async runtime should make it worse from a throughput perspective for a thread pool. I actually started on a Rust version [0] to test out this theory of whether async-rust was the culprit, but realized that I was being nerd-sniped [1] at this point and I should continue my Zig work instead. If you're still interested, I'm open to receiving PRs and questions on that if you want to see that in action.
It's still correct to benchmark and compare tokio here given the scheduler I was designing was mean to be used with async tasks: a bunch of concurrent and small-executing work units. I mention this in the second paragraph of "Why Build Your Own?".
The thread pool in the post is meant to be used to distribute I/O bound work. A friend of mine hooked up cross-platform I/O abstractions to the thread pool [2], benchmarked it against tokio to be have greater throughput and slightly worse tail latency under a local load [3]. The thread pool serves it's purpose and the quicksort benchmark is to show how schedulers behave under relatively concurrent work-loads. I could've used a benchmark with smaller tasks than the cpu-bound partition()/insertion_sort() but this worked as a common example.
I've already mentioned why rayon isn't a good comparison: 1. It doesn't support async root concurrency. 2. scoped() waits for tasks to complete by either blocking the OS thread or using similar inline-scheduler-loop optimizations. This risks stack overflow and isn't available as a use case in other async runtimes due to primarily being a fork-join optimization.
[0]: https://github.com/kprotty/zap/blob/blog-rust/src/thread_poo...
[2]: https://github.com/lithdew/hyperia
[3]: https://gist.github.com/kprotty/5a41e9612657de00788478a7dde4...
This is not the case, it measures the time between two points in the code at runtime and prints that[1].
[1] https://github.com/kprotty/zap/blob/blog/benchmarks/rust/ray...
-
Question: Does Zig has work-stealing/sharing algorithm in the M:N concurrency model ?
You can implement one: https://github.com/kprotty/zap/blob/lifo/src/runtime/Pool.zig
-
Tokio-uring design proposal
BTW If you're interested in work stealing, i'm writing my own which has a bundle of optimizations for minimal task dispatch overhead and memory efficiency. To appease some of your criteria: yes, it's currently being used in "real world production" for an http server (although not that specific version).
-
MEIO: async actors framework
This is a logical fallacy. Specifically either a "Slippery Slope" or "Either/Or". You assume that fast channel implementations must have originated or have been ported to Rust and are both popular. Things like Stakker and zap are anecdotal examples of where this already isn't the case. Even so, there exists fast synchronized channels both inside and outside of async Rust. Because they aren't popular or aren't tuned to efficient runtimes doesn't mean they don't exist, which was my argument.
-
A note from our sponsor - #<SponsorshipServiceOld:0x00007f160d031090>
www.saashub.com | 25 Mar 2023
Stats
Basic zap repo stats
7
321
0.0
3 months ago
kprotty/zap is an open source project licensed under MIT License which is an OSI approved license.
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com