Choice Coordination with Multiple Alternatives (Preliminary Version)

Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processes which causes all correct processes to agree on one out of k possible alternatives. The agreement on a single choice is complicated by the fact that there is no a priori agreement on names for the alternatives. Furthermore processes must state their choice and do all communication via registers associated with the alternatives. We exactly characterize when the k-CCP can be solved deterministiclly, prove upper and lower space bounds for deterministic solutions, and provide a randomized protocol which is significantly better than the deterministic lower bound.

• Type: Conference
• Year: 1992
• Where: WDAG
• Authors: David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang
• Keywords: Algorithms, Choice Coordination Problem, Deterministic Lower Bound, Possible Alternatives, WDAG 1992