Issue No. 02 - February (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.663873
<p><b>Abstract</b>—We present M<scp>ULTI</scp>, a symmetric, distributed, randomized algorithm that, with probability one, schedules multiparty interactions in a strongly fair manner. To our knowledge, M<scp>ULTI</scp> is the first algorithm for strong interaction fairness to appear in the literature. Moreover, the expected time taken by M<scp>ULTI</scp> to establish an interaction is a constant not depending on the total number of processes in the system. In this sense, M<scp>ULTI</scp> guarantees real-time response. M<scp>ULTI</scp> makes no assumptions (other than boundedness) about the time it takes processes to communicate. It, thus, offers an appealing tonic to the impossibility results of Tsay and Bagrodia, and Joung concerning strong interaction fairness in an environment, shared-memory, or message-passing, in which processes are deterministic and the communication time is nonnegligible. Because strong interaction fairness is as strong a fairness condition that one might actually want to impose in practice, our results indicate that randomization may also prove fruitful for other notions of fairness lacking deterministic realizations and requiring real-time response.</p>
Randomized algorithms, distributed algorithms, strong interaction fairness, weak interaction fairness, multiparty interaction, committee coordination.
S. A. Smolka and Y. Joung, "Strong Interaction Fairness Via Randomization," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 137-149, 1998.