found it linked from a plataformatec blog paper: www.frankmcsherry.org/assets/COST.pdf plataformatec article: blog.plataformatec.com.br/2017/03/small-data-with-elixir/
The partition function is a mapper 42:30 and all producers know all consumers in advance. For example if your map function is just casting a value to boolean, the mapper is simply a simple case expression: [true -> state A, false -> state B]
![[Part 1] ทารกน้อยถูกทิ้ง👶 หญิงชราเก็บขวดขายเลี้ยงดูเขาจนโต #โลกการละคร](http://i.ytimg.com/vi/nPTDvFCExks/mqdefault.jpg)
Beautiful talk ;)
Elixir really is crazy cool and José became my hero for all the work he has done!
José is so good at explaining complex concepts, thank you!
So much enthusiasm, you can feel the love Jose has when he is speaking ❤️
Great talk. Thank you for sharing!
Wow.. just wow. How did I miss this thing till now.
Fantastic talk. Great communicator, great concept.
Glad I've been there :)
Great talk! Really cool design.
what’s the title of the paper Jose brings up near the end of the talk regarding concurrency on single machine, “Cost...” ?
found it linked from a plataformatec blog
paper:
www.frankmcsherry.org/assets/COST.pdf
plataformatec article:
blog.plataformatec.com.br/2017/03/small-data-with-elixir/
Great talk ! thank you
the problem is that the difficult concepts are trivialized. Like how do you ensure that the "ares" are always going to the same node?
Hashing
The partition function is a mapper 42:30 and all producers know all consumers in advance. For example if your map function is just casting a value to boolean, the mapper is simply a simple case expression: [true -> state A, false -> state B]