This talk applies mechanical sympathy to server workloads that use cooperative multitasking and async/await. We’ll cover three techniques: reducing thread counts to cut tail latency, scoping locks tightly, and removing locks with help from Rust’s borrow checker, ArcSwap, and the standard Future model. Along the way, we’ll connect hardware concepts to OS behavior and show practical examples with metrics, code, and live demos.
