Simple Elixir MapReduce
summary
A simple MapReduce is implemented in Elixir as a concurrent word count that actually runs end to end: file reader spawns mapper processes which send key/value tuples to a single partition process that does mailbox draining and uniqueness checks, partition spawns per-key reducers and uses Task.start_link and spawn for links, reducers sum with Enum.reduce and an accumulator, and an output writer writes a file and exits the supervision chain. It works on small inputs and deliberately avoids full OTP GenServer complexity.
AI-written summary · about
chapters (6)
- 0:00Start
- 0:59Mapreduce the Data Flow
- 2:54Word Count Example
- 15:46Keyword List
- 17:33String Interpolation
- 21:51Questions
related talks
42mIntroduction to Elixir for Rubyists
39mElixir: Power of Erlang, Joy of Ruby
32mElixir for the rubyist
34mReducing Enumerable - An Illustrated Adventure
34mRubyists, have a sip of Elixir!
33mReducing Enumerable - An Illustrated Adventure
28mRuby + Elixir: Polyglotting FTW!
53mBuilding Performant Backends with Elixir