The analysis of algorithms
Design & analysis of fault tolerant digital systems
Design & analysis of fault tolerant digital systems
SIAM Journal on Computing
Neural networks: a systematic introduction
Neural networks: a systematic introduction
Computer networks (3rd ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Fast Gossiping by Short Messages
SIAM Journal on Computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Advanced Computer Architectures
Advanced Computer Architectures
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment
IEEE Transactions on Parallel and Distributed Systems
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
A family of gossiping algorithms depending on a parameter permutation is introduced, formalized, and discussed. Several of its members are analyzed and their asymptotic behaviour is revealed, including a member whose model and performance closely follows the one of hardware pipelined processors. This similarity is exposed. An optimizing algorithm is finally proposed and discussed as a general strategy to increase the performance of the base algorithms.