Algorithm · Anthropic · Hard
Distributed Mode and Median Basic Problem You have the following resources: A huge collection of data split among several machines, usually 10 workers. Existing communication primitives named send(worker_id, data) and recv(). Each worker retains one local shard of the overall input. Build a distributed algorithm that identifies the mode, meaning the value with the greatest total frequency across every shard. Critical Constraint: Network throughput is the limiting resource.…
Checking your access…