Premium
De Bruijn and Kautz bus networks
Author(s) -
Bermond JeanClaude,
Dawes Robin W.,
Ergincan Fahir Ö.
Publication year - 1997
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199710)30:3<205::aid-net5>3.0.co;2-p
Subject(s) - de bruijn sequence , computer science , interconnection , bus network , point (geometry) , generalization , parallel computing , local bus , system bus , control bus , computer network , mathematics , discrete mathematics , computer hardware , mathematical analysis , geometry
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. © 1997 John Wiley & Sons, Inc. Networks 30:205–218, 1997