3 ms·
There's often a tradeoff between latency and throughput. Think GC algorithms or IO buffers. The Erlang project has historically chosen the far left end of this
by tormeh 5y ago
There's often a tradeoff between latency and throughput. Think GC algorithms or IO buffers. The Erlang project has historically chosen the far left end of this spectrum. They also haven't cared about numerical performance at all, delegating that to C code.
- exikyut 5y agoOoooh, burst response as opposed to flat-out super tight hot loops. That honestly makes a lot of sense. Thanks!