libaco, a blazing fast and lightweight C asymmetric coroutine library. Along with the implementation of a production-ready C coroutine library, here is detailed documentation about how to implement the fastest and correct coroutine library and also with strict mathematical proof. It has no more than 700 LOC but has the full functionality which you may want from a coroutine library. The benchmark part shows that a context switch between coroutines only takes about 10 ns (in the case of the standalone stack) on the AWS c5d.large machine. User could choose to create a new coroutine with a standalone stack or with a shared stack (could be shared with others). It is extremely memory-efficient, 10,000,000 coroutines simultaneously to run cost only 2.8 GB physical memory (run with tcmalloc, each coroutine has a 120B copy-stack size configuration). The phrase "fastest" in above means the fastest context switching implementation which complies to the Sys V ABI of Intel386 or AMD64.
Features
- Currently supports Sys V ABI of Intel386
- Currently supports Sys V ABI of x86-64
- It has no more than 700 LOC
- The benchmark part shows that a context switch between coroutines only takes about 10 ns
- Create a new coroutine with a standalone stack
- It is extremely memory efficient