Fault Tolerance Techniques for Distributed Systems
Graph Partitioning Abhiram Ranade IIT Bombay. A load balancing problem Input: – undirected graph G. Vertices = processes. Edges = interprocess communication.
Graph Partitioning