zeroexcuses
Algorithm behind Phoenix pub/sub & presence
Is there a whitepaper somewhere explaining the algorithms / design of Phoenix.Pubsub and Phoenix.Presence ?
In particular, I am not asking about how to use Phoenix.PubSub / Phoenix.Presence.
I am asking about how they are implemented / design tradeoffs made in their design. In particular, the distributed elixir case, of nodes running on different machines in the same VPC.
Most Liked
kip
The following links might help:
- CRDT algorithm underpinning presence
- Phoenix Presence sneak-peak
- {Introduction of Pub Sub and Channels](https://www.youtube.com/watch?v=RPs4SHpSThU)
kip
Phoenix.PubSub is quite straight forward. Phoenix Presence is more complex given it is managing distributed state (hence the CRDT).
zeroexcuses
Thanks, I also came across Simple, Distributed and Scalable PubSub in Erlang | Carlos Andres Bolaños . Is Phoenix.PubSub relatively ‘straight forward’? For some reason, I thought there would be some crazy complexity behind it, but it almost seems like it is implementing a straight forward “standard/obvious” algorithm.
Popular in Discussions
Other popular topics
Categories:
Sub Categories:
Forums
Popular Tags
- #ecto
- #liveview
- #troubleshooting
- #learning-elixir
- #deployment
- #library
- #erlang
- #testing
- #genserver
- #mix
- #absinthe
- #remote-other
- #otp
- #plug
- #how-to-question
- #macros
- #postgres
- #channels
- #elixirconf
- #exunit
- #discussion
- #javascript
- #code-sync
- #podcasts
- #onsite
- #dialyzer
- #docker
- #authentication
- #umbrella
- #full-time-contract
- #podcasts-by-brainlid
- #ecto-query
- #elixir-ls
- #phoenix_html
- #iex
- #blog-post
- #graphql
- #genstage
- #ai
- #websockets
- #supervisor
- #advent-of-code
- #elixirconf-us
- #distillery
- #processes
- #forms
- #api
- #metaprogramming
- #security
- #performance








