Neighbourhood Gossiping in Hypercubes-Reference-Cited by-同舟云学术

Neighbourhood Gossiping in Hypercubes

Published:1998-06 Issue:02 Volume:08 Page:189-195
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

Fujita Satoshi¹,Perennes Stephane²,Peters Joseph G.³

Affiliation:

1. Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739, Japan

2. INRIA - SLOOP, 2004 Route des Lucioles, B.P 93, F-06902 Sophia-Antipolis, France

3. School of Computing Science, Simon Fraser University, Burnaby, British Columbia, V5A 1S6, Canada

Abstract

In the neighbourhood gossiping problem, each node of a network starts with a unique message and must learn the messages of all of its neighbours. In this paper, we prove upper and lower bounds for neighbourhood gossiping in hypercubes under the single-port half-duplex and single-port full-duplex communication models.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

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

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

1. Temporally connected components;Theoretical Computer Science;2024-10

2. Temporally Connected Components;2023

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

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

5. Edge-disjoint spanning trees for the generalized butterfly networks and their applications;Journal of Parallel and Distributed Computing;2005-11