| | Strong interaction fairness via randomization (Site not responding. Last check: 2007-10-07) |
 | | We present Multi, a symmetric, fully distributed, randomized algorithm that, with probability 1, schedules multiparty interactions in a strongly fair manner. |
 | | It thus offers an appealing tonic to the impossibility results of TsayandBagrodia 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. |
| csdl.computer.org /comp/proceedings/icdcs/1996/7398/00/73980475abs.htm (241 words) |