YUH-JZER JOUNG2020-02-112020-02-11200003043975https://scholars.lib.ntu.edu.tw/handle/123456789/457554We present two randomized algorithms, one for message passing and the other for shared memory, that, with probability 1, schedule multiparty interactions in a strongly fair manner. Both algorithms improve upon a previous result by Joung and Smolka (proposed in a shared-memory model, along with a straightforward conversion to the message-passing paradigm) in the following aspects: first, processes' speeds as well as communication delays need not be bounded by any predetermined constant. Secondly, our algorithms are completely decentralized, and the shared-memory solution makes use of only single-writer variables. Finally, both algorithms are symmetric in the sense that all processes execute the same code, and no unique identifier is used to distinguish processes. © 2000 Elsevier Science B.V. All rights reserved.Multiparty interaction; Randomized algorithm; Strong interaction fairness; Weak interaction fairnessjournal article10.1016/S0304-3975(98)00224-22-s2.0-0001015783https://www.scopus.com/inward/record.uri?eid=2-s2.0-0001015783&doi=10.1016%2fS0304-3975%2898%2900224-2&partnerID=40&md5=218c683c0a3559e4377a6b98853a455f