Concurrency Fount: a Pace-Regulated Supply of Newly Spawned Processes
summary
Claims a concrete library: cxy_fount behaviour in duomark/epocxy provides a reservoir of pre‑spawned single‑use Erlang processes that are unlinked when handed out and replaced by a separate regulator running slabed spawns (default one slab per 0.01s). It trades memory for amortized spawn latency, enforces backpressure by draining slabs, avoids supervised pooled-worker bottlenecks, and shows a hex‑dump example that formats lines in parallel to prove the slab allocation and refill mechanics work under spikes.
AI-written summary · about
chapters (6)
- 0:00Start
- 3:27Concurrency Control
- 12:19Third-Party Libraries
- 14:55Load Balancing
- 32:44Conclusion
- 37:47Use Processes To Partition Your Architecture
related talks
01h 04mA Pattern Language for Expressing Concurrency in Cpp
28mConcurrency, Functional Paradigm and Dynamic Flow Control in Multimedia Processing
49mThinking in a Highly Concurrent, Mostly-functional Language
38mAccidentally Concurrent
42mHistory of Concurrency
43m(...) Rewriting an Existing PubSub Erlang System
40mDistributed, Eventually Consistent Computations
05mCombat Chaos-Driven Delivery By Thinking Like An OS