Choice coordination with multiple alternatives (preliminary version) [chapter]

David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang
1992 Lecture Notes in Computer Science  
The Choice Coordination Problem with k alternatives (k-CCP) 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
more » ... s. 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.
doi:10.1007/3-540-56188-9_4 fatcat:vn2wr7si3zet7arzypcyfmylx4