Question

Description acceptable until the end of the question. A paper by Gallager, Humblet, and Spira on minimum spanning trees introduced a general algorithm for this task known as Mega-Merger. Gérard Le Lann, the original formulator of this problem, considered it as the case of creating a new token in a ring network. After failing to receive a heartbeat, a process might execute the bully algorithm for this task. The first step in the Raft algorithm is performing this task asynchronously, (15[1])while the Paxos algorithm can optionally (-5[1])do this task or use random wait times to reduce (15[1])livelock. This task often involves nodes in a network broadcasting their process IDs to their neighbors to find the node with (15[1])the (*) largest ID. (10[1])Reasoning (10[1])about consistency is easier in distributed systems that perform this task, since all concurrency is concentrated in one place. For 10 points, (-5[1])name this task of deciding on a single node to be a central coordinator. ■END■ (0[4])

Buzzes

Summary