Solid Ground
summary
Claim: BEAM gives predictable responsiveness via frequent preemption so a single-core one scheduler still serves short requests while a CPU-bound request runs. Demo uses Cowboy/Plug web app computing a sum, sets scheduler count to one, and hits it with a huge N (many 9s) to show short requests return in milliseconds. Debugging uses Observer, lists pids and reduction counts, and a DBG tracer to reveal infinite recursion on negative input; terminate the culprit with a kill exit and sockets and resources close cleanly.
AI-written summary · about
chapters (5)
- 0:00Start
- 5:32frequent context switches
- 11:25activities as runtime citizens
- 21:45shared-nothing concurrency
- 25:18supervision tree
related talks
25mGreen Benchmarking of BEAM Languages
38mPractical Performance Analysis
29mSite Availability is for Everybody
41mIn The Loop
42mWhen the OS gets in the way
30mAbove the Clouds: Investigating Systems from 32,000 ft.
21mStateless Datacenter Load-balancing with Beamer
44mMaking apps seem faster without optimizing