Skip to Main content Skip to Navigation
Journal articles

De Bruijn and Kautz Bus networks

Jean-Claude Bermond 1 Robin Dawes 2 Fahir Ö. Ergincan 2
1 SLOOP - Simulation, Object Oriented Languages and Parallelism
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Our aim was to find bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus, and the network diameter. Point‐to‐point networks are a special case of bus networks in which every bus connects only two processors. In this case, de Bruijn and Kautz networks and their generalizations are known to be among the best families of networks with respect to the aforementioned criteria. In this paper, we present the directed de Bruijn bus networks, which connect two or more processors on a bus and contain the point‐to‐point de Bruijn networks and their generalization as a special case. We study two different schemes of the directed de Bruijn bus networks. We also show that the directed Kautz bus networks can be defined in the same manner.
Complete list of metadata

https://hal.inria.fr/hal-03210219
Contributor : Jean-Claude Bermond <>
Submitted on : Tuesday, April 27, 2021 - 6:35:29 PM
Last modification on : Thursday, April 29, 2021 - 3:31:36 AM

File

98-BDE97-debruijn-bus-networks...
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Claude Bermond, Robin Dawes, Fahir Ö. Ergincan. De Bruijn and Kautz Bus networks. Networks, Wiley, 1997, 30 (3), pp.205-218. ⟨10.1002/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P⟩. ⟨hal-03210219⟩

Share

Metrics

Record views

25

Files downloads

99