Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Properties of complexity measures for prams and wrams
Theoretical Computer Science
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Topics in distributed algorithms
Topics in distributed algorithms
SIAM Journal on Computing
SIAM Journal on Computing
Fast information sharing in a complete network
Discrete Applied Mathematics
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Parallel Information Dissemination by Packets
SIAM Journal on Computing
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Broadcasting in butterfly and deBruijn networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Introduction to distributed algorithms
Introduction to distributed algorithms
Exploiting storage redundancy to speed up randomized shared memory simulations
Theoretical Computer Science
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
SIAM Journal on Computing
ERCW PRAMs and optical communication
Theoretical Computer Science - Special issue on parallel computing
An Optical Simulation of Shared Memory
SIAM Journal on Computing
Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey
MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
Impact of dynamics on situated and global aggregation schemes
AIMS'11 Proceedings of the 5th international conference on Autonomous infrastructure, management, and security: managing the dynamics of networks and services
| Hi-index | 0.00 |
In the theory of dissemination of information in interconnection networks (gossiping and broadcasting) one assumes that a message consists of a set of distinguishable, atomic pieces of information, and that one communication pattern is used for solving a task. In this paper, a close connection is established between this theory and a situation in which functions are computed in synchronous networks without restrictions on the type of message used and with possibly different communication patterns for different inputs. The following restriction on the way processors communicate turns out to be essential: (*) "Predictable reception": At the beginning of a step a processor knows whether it is to receive a message across one of its links or not. We show that if (*) holds then computing an n-ary function with a "critical input" (e.g., the OR of n bits) and distributing the result to all processors on an n-processor network G takes exactly as long as performing gossiping in G. Further we study the complexity of broadcasting one bit in a synchronous network, assuming that in one step a processor can send only one message, but without assuming (*), and broadcasting one bit on parallel random-access machines (PRAMs) and distributed memory machines (DMMs) with the ARBITRARY access resolution rule.