Lightning Talks
summary
Several short demos land on concrete claims: a graph-as-actors model that runs path searches at about 5 µs per vertex on a 1.24M‑node dataset and scales predictably; a re‑entrant LL(1) parser generator on GitHub that returns continuations and rejects left recursion; a hard‑real‑time Erlang approach using earliest‑deadline‑first scheduling with fixed two‑part heaps and mailbox policies; a Samza/Kafka pattern proposal using parallel worker batching for higher throughput; and a note about an Erlang community site.
AI-written summary · about
chapters (12)
- 0:00Graph Model
- 7:43Spell1 parser generator
- 14:48Hard realtime Ellen
- 15:13Hard realtime definition
- 15:53Hard realtime nalang
- 16:33Are Erlangs small
- 18:44Hard RealTime
- 22:10Garbage Collection
- 23:46Mailbox Behavior
- 27:45Static Analysis
- 32:23Big Data
- 36:45Erlang Central
