Issue No. 09 - September (2003 vol. 14)
<p><b>Abstract</b>—The Global Data Computation problem consists of providing each process with the same vector (with one entry per process) such that each entry is filled by a value provided by the corresponding process. This paper presents a protocol that solves this problem in an asynchronous distributed system where processes can crash, but equipped with a perfect failure detector. This protocol requires that processes execute asynchronous computation rounds. The number of rounds is upper bounded by min(f + 2, t + 1, n), where n, t, and f represent the total number of processes, the maximum number of processes that can crash, and the number of processes that actually crash, respectively. This value is a lower bound for the number of rounds when t < n - 1. To our knowledge, this protocol is the first to achieve this lower bound. Interestingly, this protocol meets the same lower bound as the one required in synchronous systems.</p>
Asynchronous distributed systems, crash failure, distributed computing, early stopping, fault tolerance, global data, perfect failure detector, reliability.
C. Delporte-Gallet, H. Fauconnier, J. H?lary and M. Raynal, "Early Stopping in Global Data Computation," in IEEE Transactions on Parallel & Distributed Systems, vol. 14, no. , pp. 909-921, 2003.