A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
Parallel computation: models and methods
Parallel computation: models and methods
Neighborhood Information Dissemination in the Star Graph
IEEE Transactions on Computers
Parallel Routing and Sorting of the Pancake Network
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
A Novel Neighbourhood Broadcasting Algorithm on Star Graphs
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
A unified neighbourhood broadcasting scheme for multiple messages on interconnection networks
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
A unified neighbourhood broadcasting scheme for multiple messages on interconnection networks
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
| Hi-index | 0.00 |
The neighbourhood broadcasting problem on an interconnection network is defined as sending a fixed sized message from the source node to all its neighbours where in one time unit, a node can send to or receive from exactly one of its neighbours a datum of constant size. Previously, this problem has been studied for the hypercube, the star and the pancake interconnection networks, and a special family of Cayley graphs of permutation groups formed by transpositions. Here, we study the problem when the source node has m multiple messages (or a single message of size m). We develop a simple and novel scheme so that the neighbourhood broadcasting of m messages can be done in asymptotically optimal time of O(m +log n), where n is the degree of the source node. This scheme is a general and unified scheme in that it applies to several interconnection networks such as the hypercube, the star, and the pancake, all in the family of Cayley graphs. The scheme can be used in any regular interconnection networks with the similar cycle structure as in the aforementioned graphs.