https://github.com/geph-official/smolscale

https://github.com/geph-official/smolscale

Last synced: 5 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/geph-official/smolscale
• Owner: geph-official
• Created: 2021-06-23T23:04:42.000Z (over 3 years ago)
• Default Branch: master
• Last Pushed: 2024-08-30T14:17:59.000Z (3 months ago)
• Last Synced: 2024-09-30T15:56:38.092Z (about 2 months ago)
• Language: Rust
• Size: 115 KB
• Stars: 39
• Watchers: 5
• Forks: 3
• Open Issues: 2
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# smolscale

A global, auto-scaling scheduler for [async-task] using work-balancing.

### What? Another executor?

`smolscale` is a **work-balancing** executor based on [async-task], designed to be a drop-in replacement to `smol` and `async-global-executor`. It is designed based on the idea that work-stealing, the usual approach in async executors like `async-executor` and `tokio`, is not the right algorithm for scheduling huge amounts of tiny, interdependent work units, which are what message-passing futures end up being. Instead, `smolscale` uses *work-balancing*, an approach also found in Erlang, where a global "balancer" thread periodically balances work between workers, but workers do not attempt to steal tasks from each other. This avoids the extremely frequent stealing attempts that work-stealing schedulers generate when applied to async tasks.

`smolscale`'s approach especially excels in two circumstances:

- **When the CPU cores are not fully loaded**: Traditional work stealing optimizes for the case where most workers have work to do, which is only the case in fully-loaded scenarios. When workers often wake up and go back to sleep, however, a lot of CPU time is wasted stealing work. `smolscale` will instead drastically reduce CPU usage in these circumstances --- a `async-executor` app that takes 80% of CPU time may now take only 20%. Although this does not improve fully-loaded throughput, it significantly reduces power consumption and does increase throughput in circumstances where multiple thread pools compete for CPU time.

- **When a lot of message-passing is happening**: Message-passing workloads often involve tasks quickly waking up and going back to sleep. In a work-stealing scheduler, this again floods the scheduler with stealing requests. `smolscale` can significantly improve throughput, especially compared to executors like `async-executor` that do not special-case message passing.

License: ISC