Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Optimal algorithms for dissemination of information in generalized communication modes
Proceedings of the international workshop on Broadcasting and gossiping 1990
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs
Information and Computation
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Information and Computation
Minimum-time multidrop broadcast
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Graph Algorithms
| Hi-index | 5.23 |
A new communication mode for the dissemination of information among processors of interconnection networks via vertex-disjoint paths is introduced and investigated. In this communication mode, in one communication step two processors communicating via a path P send their pieces of information to all other processors on this path, too. The complexity of a communication algorithm is measured by the number of communication steps (rounds). In this paper we will design optimal broadcast, accumulation, and gossip algorithms for various classes of networks including paths, cycles, and hypercube-like networks. The main results are optimal accumulation and gossip algorithms for the two-dimensional grid. The technique used for the design of these algorithms is based on 1nding Hamiltonian paths in the grid with certain endpoints or center points.