The Wisconsin multicube: a new large-scale cache-coherent multiprocessor
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Square Meshes are Not Always Optimal
IEEE Transactions on Computers
SIAM Journal on Computing
A lower bound for permutation routing on two-dimensional bused meshes
Information Processing Letters
Array processor with multiple broadcasting
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Routing Problems on the Mesh of Buses
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Toward Optimal Complete Exchange on Wormhole-Routed Tori
IEEE Transactions on Computers
Pipelined All-to-All Broadcast in All-Port Meshes and Tori
IEEE Transactions on Computers
An Optimal Multiple Bus Network for Fan-in Algorithms
ICPP '97 Proceedings of the international Conference on Parallel Processing
| Hi-index | 14.99 |
A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for mesh-bus computers assuming that each packet can carry at most $\ell$ tokens in a step, where $\ell$ is a function of the number of all nodes. It is shown that by selecting the fastest algorithm among them, for each given function $\ell$, a lower bound on the gossiping time can be attained asymptotically.