Early stopping in Global Data Computation |
| |
Authors: | Delporte-Gallet C Fauconnier H Helary J-M Raynal M |
| |
Affiliation: | LIAFA, Paris, France; |
| |
Abstract: | 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
|
| |
Keywords: | |
|
|