sozu
preemptible-thread
sozu | preemptible-thread | |
---|---|---|
8 | 16 | |
2,833 | 23 | |
1.0% | - | |
9.4 | 5.1 | |
8 days ago | 4 months ago | |
Rust | C | |
GNU Affero General Public License v3.0 | - |
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.
sozu
-
Erlang: More Optimizations in the Compiler and JIT
This is interesting, thank you.
I really should learn from BEAM and the OTP and learn Erlang. I get the feeling it's super robust and reliable and low maintenance. I wrote a userspace multithreaded scheduler which distributes N lightweight threads to M kernel threads.
https://github.com/samsquire/preemptible-thread
I recently wrote a JIT compiler and got lazy compilation of machine code working and I'm nowhere near beginning optimisation
https://github.com/samsquire/compiler
How do you write robust software, that doesn't crash when something unexpected goes on?
I looked at sozo https://github.com/sozu-proxy/sozu
and I'm thinking how to create something that just stays up and running regardless.
-
Open Source HTTP Reverse Proxy Built in Rust for Immutable Infrastructures
It's AGPL licensed which for a proxy is a strange choice. They have an unanswered question for months on what it might mean: https://github.com/sozu-proxy/sozu/issues/764
Without an answer to that if you use this and you need to make any change to it (even a tiny bug fix), you're basically opening yourself up a pile of legal issues.
-
Rust-based reverse proxy?
Sozu: Well documented, runtime configurable proxy
-
Do most people just restart their Rust web servers once every three months?
https://github.com/sozu-proxy/sozu https://github.com/sozu-proxy/sozu/blob/main/doc/design_motivation.md
-
Force all rust application traffic to pass from proxy.
Could sozu or rathole or leaf or exodus somehow help?
-
Scalable server design in Rust with Tokio
it is not sufficient: a listen socket has its own queue of new TCP connections (that were already handshaked by the kernel), so dropping the listen socket drops the queue. The right way is to start the new server, transfer the listen socket from the old server to the new one with SCM_RIGHTS, then start accepting again from the new instance. That's how it is done in the sozu HTTP proxy (which also uses SO_REUSEPORT to launch multiple work processes each with their own listeners, to improve performance and isolate failure)
-
Any thoughts about Clever Cloud? (Has native rust support.)
BTW that traffic will be coming from our sozu load balancers, built in Rust too ;)
-
ARLB: A very experimental load balancer/reverse proxy based on hyper and tokio
How does it compare to sozu?
preemptible-thread
-
Threads and Goroutines
Thanks for this article.
I want to combine the benefits of kernel threads with coroutines or goroutines/green threads/lightweight threads. (If anybody knows anything specifically about fibers, I'd appreciate that because I'm not familiar with them.)
I have a lightweight thread scheduler https://github.com/samsquire/preemptible-thread which is a 1:M:N scheduler (1 scheduler thread, M kernel threads, N lightweight threads) with the lightweight threads being multiplexed on the kernel threads.
I am working on a multithreaded architecture which I all 3 tier multithreaded architecture. It combines request parallelism with IO and CPU parallelism and intra request parallelism.
We split kernel threads into three groups: app threads, which run lightweight threads, IO threads (liburing/epoll) and traditional CPU threadpool with work stealing.
* The IO threads have buffers that other threads can write to to queue up data for sockets.
-
Async rust – are we doing it all wrong?
How would you do control flow and scheduling and parallelism and async efficiently with this code?
`db.save()`, `download()` are IO intensive whereas `document.query("a")` and `parse` is CPU intensive.
I think its work diagram looks like this: https://github.com/samsquire/dream-programming-language/blob...
I've tried to design a multithreaded architecture that is scalable which combines lightweight threads + thread pools for work + control threads for IO epoll or liburing loops:
Here's the high level diagram:
https://github.com/samsquire/ideas5/blob/main/NonblockingRun...
The secret is modelling control flow as a data flow problem and having a simple but efficient scheduler.
I wrote about schedulers here and binpacking work into time:
https://github.com/samsquire/ideas4#196-binpacking-work-into...
I also have a 1:M:N lightweight thread scheduler/multiplexer:
https://github.com/samsquire/preemptible-thread
-
Coroutines for Go
* I want to keep IO and CPU in flight at all times.
I think I want this schedule:
https://user-images.githubusercontent.com/1983701/254083968-...
I have a toy 1:M:L 1 scheduler thread:M kernel threads:N lightweight threads lightweight scheduler in C, Rust and Java
https://github.com/samsquire/preemptible-thread
This lets me switch between tasks and preempt them from user space without assistance at descheduling time.
I have a simplistic async/await state machine thread pool in Java. My scheduling algorithm is very simple.
I want things like backpressure, circuit breakers, rate limiting, load shedding, rate adjustment, queuing.
-
Goroutines: The concurrency model we wanted all along
Thanks for this article and to ingve for submitting it.
Concurrency and async is my favourite topic. I wrote a very simple toy lightweight 1:M:N (1 scheduler:M kernel threads:N lightweight threads) thread scheduler in C, Rust and Java.
https://github.com/samsquire/preemptible-thread
It works on the principle that hot loops can be interrupted BY ANOTHER THREAD (the scheduler thread) on a timer, to give lightweight threads a chance to execute.
What I think I want today though is an extremely rich process/concurrency API that resembles a stream API but for processes. For example, we should be able to create pipelines that can be paused, resumed, forked, merged, drop_while, iterate_until and whatever else would be useful.
-
Coroutines make robot code easy for high schoolers
I really like this.
Thank you for your comment and sharing.
I have a lightweight 1:M:N runtime (1 scheduler thread, M kernel threads, N lightweight threads) which preempts by setting hot loops to the limit.
https://github.com/samsquire/preemptible-thread (Rust, Java and C)
How do you preempt code that is running?
-
Is Parallel Programming Hard, and, If So, What Can You Do About It? v2023.06.11a
https://github.com/samsquire/ideas5/blob/main/NonblockingRun...
The design is that we have three groupings of thread types. The application starts up some application threads which are not associated with a request, these service multiconsumer multiproducer thread safe ringbuffers in lightweight threads with a Go-erlang-like lightweight process runtime. (My simple lightweight thread runtime is https://github.com/samsquire/preemptible-thread) We also multiplex multiple network clients sockets across a set number of kernel threads which I call control threads. Their responsibility is to dispatch work to a work stealing thread pool ASAP which has its own group of threads. So we pay a thread synchronization cost ONCE per IO which is the dispatch from the control thread to a thread pool thread. (Presumably this is fast, because the thread pool threads are all looping on a submission queue)
We split all IO and CPU tasks into two halves: submit and handle reply. I assume you can use liburing or epoll in the control threads. The same with CPU tasks and use ringbuffers to communicate between threads. We can always serve client's requests because we're never blocked on handling someone else's request. The control thread is always unblocked.
I think this article is good regarding Python's asyncio story:
-
Zig Language Server and Cancellation
I am deeply interested in the multithreading, parallelism, async and coroutine design space and I journal about it everyday in my ideas journal.
I wrote a toy very simple 1:M kernel threads:N lightweight thread runtime in terrible Rust, C and Java.
Hot loops use a structure for its limit and looping variable. Then to cancel the loop, you set the looping variable to the limit from a scheduling thread, cancelling the loop. This is used for process switching and scheduling but it can also be used for cancellation.
Can create very responsive code this way, it's even possible to cancel while (true) loops by replacing them with while (!preempted) {}.
https://github.com/samsquire/preemptible-thread
There is potential for a race, but that can be detected and worked around.
-
Notes on my incomplete JIT compiler
I also have a M:N m kernel threads to N lightweight thread userspace preemptive scheduler at https://github.com/samsquire/preemptible-thread It would be nice to schedule lightweight threads in a JIT compiler. Imagine being capable of running processes similar to BEAM and Go but with JIT.
-
Erlang: More Optimizations in the Compiler and JIT
This is interesting, thank you.
I really should learn from BEAM and the OTP and learn Erlang. I get the feeling it's super robust and reliable and low maintenance. I wrote a userspace multithreaded scheduler which distributes N lightweight threads to M kernel threads.
https://github.com/samsquire/preemptible-thread
I recently wrote a JIT compiler and got lazy compilation of machine code working and I'm nowhere near beginning optimisation
https://github.com/samsquire/compiler
How do you write robust software, that doesn't crash when something unexpected goes on?
I looked at sozo https://github.com/sozu-proxy/sozu
and I'm thinking how to create something that just stays up and running regardless.
-
Erlang's not about lightweight processes and message passing
I wrote a preemptive 1:M:N scheduler in C, Rust and Java.
https://github.com/samsquire/preemptible-thread
It is a 1:M:N scheduler where there is one scheduler thread, M kernel threads and N lightweight threads. I take advantage that loop indexes can be structures and can be modified by other threads. So we can set the thread's looping variable to the limit to end the current loop and pause it and then schedule another thread.
What are some alternatives?
ics-proxy - A calendar proxy application that allows keeping the calendar URL stable while changing the target URL.
Melang - A script language of time-sharing scheduling coroutine in single thread
another-rust-load-balancer - A load balancer with support for different middlewares and load balancing strategies, based on hyper and tokio
ideas4 - An Additional 100 Ideas for Computing https://samsquire.github.io/ideas4/
tuic - Delicately-TUICed 0-RTT proxy protocol
quickserv - Dangerously user-friendly web server for quick prototyping and hackathons
quilkin - Quilkin is a non-transparent UDP proxy specifically designed for use with large scale multiplayer dedicated game server deployments, to ensure security, access control, telemetry data, metrics and more.
blech - Blech is a language for developing reactive, real-time critical embedded software.
hudsucker - Intercepting HTTP/S proxy
quaint-lang - An experimental statically typed procedural language with first-class resumable functions.
rust-lsp-proxy - A language server proxy that provides file synchronization and code execution
dream-programming-language - notes on my dream programming language