De Bruijn and Kautz Bus networks - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Networks Année : 1997

De Bruijn and Kautz Bus networks

Résumé

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.
Fichier principal
Vignette du fichier
98-BDE97-debruijn-bus-networks.pdf (4.72 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03210219 , version 1 (27-04-2021)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More