Coroutines provide end-users with new programming paradigms that present unique challenges to the design of an efficient scheduler, whose task is to allocate coroutines among operating system threads. We will contrast the coroutines workloads to more traditional fork-join workloads, show the benchmarks that drove the design of a dedicated coroutines scheduler, and discuss its algorithm, implementation details, and engineering trade-offs.