AN OPTIMAL NEIGHBOURHOOD BROADCASTING SCHEME FOR STAR INTERCONNECTION NETWORKS-Reference-Cited by-同舟云学术

AN OPTIMAL NEIGHBOURHOOD BROADCASTING SCHEME FOR STAR INTERCONNECTION NETWORKS

Published:2003-03 Issue:01 Volume:04 Page:103-112
ISSN:0219-2659
Container-title:Journal of Interconnection Networks
language:en
Short-container-title:J. Inter. Net.

Author:

MKWAWA I. M.¹,KOUVATSOS D. D.¹

Affiliation:

1. Department of Computing, University of Bradford, Bradford, BD7 1DP, UK

Abstract

A novel and efficient neighbourhood broadcasting scheme is proposed for star interconnection networks, based on binomial trees and graph theoretic concepts. The optimal scheme has an upper bound of 1.33⌈log2(n - 2)⌉ + O(1) time steps and it is applicable to both single-port and half-duplex modes of message passing communication.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Networks and Communications

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219265903000751

Reference10 articles.

1. Optimal information dissemination in star and pancake networks

2. Neighbourhood information dissemination in the star graph

3. J. Hromkovic, Combinatorial Network Theory (Kluwer Academic Publishers, 1995) pp. 125–212.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The divide-and-swap cube: a new hypercube variant with small network cost;The Journal of Supercomputing;2018-12-07

2. The new Petersen-torus networks;The Journal of Supercomputing;2014-11-25

3. Broadcasting Algorithms of Three-Dimensional Petersen-Torus Network;Journal of Applied Mathematics;2014

4. Neighborhood Broadcasting in Hypercubes;SIAM Journal on Discrete Mathematics;2008-01

5. ON A UNIFIED NEIGHBOURHOOD BROADCASTING SCHEME FOR INTERCONNECTION NETWORKS;Parallel Processing Letters;2007-12