A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
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 thedoi:10.1007/3-540-56188-9_4 fatcat:vn2wr7si3zet7arzypcyfmylx4