论文信息 - Neighbourhood Broadcasting in Hypercubes

Neighbourhood Broadcasting in Hypercubes

In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbour at a time, broadcasting takes at least ⌈log2 N⌉ rounds in a network of N nodes. In the neighbourhood broadcasting problem, the node that is broadcasting only needs to inform its neighbours. In a binary hypercube with N nodes, each node has log2 N neighbours, so neighbourhood broadcasting takes at least ⌈log2 log2(N + 1)⌉ rounds. In this paper, we present asymptotically optimal neighbourhood broadcast protocols for binary hypercubes.

[1] David W. Krumme. Fast Gossiping for the Hypercube , 1992, SIAM J. Comput..

[2] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[3] David W. Krumme,et al. Gossiping in Minimal Time , 1992, SIAM J. Comput..

[4] Shimon Even,et al. On the number of rounds necessary to disseminate information , 1989, SPAA '89.

[5] Afonso Ferreira,et al. On the Real Power of Loosely Coupled Parallel Architectures , 1991, Parallel Process. Lett..