Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Novel Distributed Algorithm for High-Throughput and Scalable Gossiping
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
TIRAN: Flexible and Portable Fault Tolerance Solutions for Cost Effective Dependable Applications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A Novel Distributed Algorithm for High-Throughput and Scalable Gossiping
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
| Hi-index | 0.00 |
A family of gossiping algorithms depending on a combinatorial parameter is introduced, formalized, and discussed. Three members are analyzed. It is shown that, depending on the pattern of the parameter, gossiping can use from O(N2) to O(N) time, N being the number of communicating members. The last and best-performing algorithm, whose activity follows the execution pattern of pipelined hardware processors, is shown to exhibit high throughput and efficiency that are constantwith respect to N. This translates in unlimited scalability for the corresponding gossiping service provided by this algorithm