A worm in my Erlang cluster, and adventures in microfluidics
2 days ago
- #Code Propagation
- #Graph Traversal
- #Erlang Clustering
- Explores sparse connectivity in Erlang clusters and introduces graph notation for visualizing node connections.
- Describes a method to map arbitrary cluster topologies by querying neighbors recursively, akin to flood-filling a graph.
- Details how to propagate code across nodes using Erlang's :code module to load binaries dynamically, enabling single-node deployment.
- Provides steps to build a test cluster with custom connections using the :peer module and demonstrates worm-like traversal.
- Highlights challenges like ensuring Elixir stdlib availability on new nodes and avoiding unintended connections during propagation.