How does Rust handle scheduler fairness in async runtimes?

Async runtimes use cooperative scheduling and work-stealing to approximate fairness.

Rust async runtimes like Tokio do not guarantee strict fairness but use task queues and work-stealing to distribute load. Long-running tasks must yield manually to avoid starvation.