Concurrency Fount: a Pace-Regulated Supply of Newly Spawned Processes by Jay Nelson


By Erlang Central | Published: September 30, 2016



Slides and more info: http://www.erlang-factory.com/euc2016/jay-nelson

Worker pools have become the most overused (and most commonly improperly implemented) Erlang tool. The new cxy_fount behaviour of https://github.com/duomark/epocxy offers an alternative that doesn’t suffer the catastrophic failures of most supervised worker strategies. It provides a reservoir of pre-spawned single-use processes, with a time-regulated replacement mechanism to allow back pressure to smooth demand spikes. The result is a tunable throttle on client requests, which ensures that the server does not exceed its computational capacity while adapting to multiple service demands simultaneously.

Talk objectives:

To explain a new architectural library component that can be introduced to provide a system with a tunable control on client demand.

Target audience:

Intermediate to advanced Erlang system engineers.



Follow Erlang Central:


Have an Erlang Question?

Reach out to the Erlang community





Tags