📖
De Bruijn and Kautz Bus networks
Jean-Claude Bermond, Robin Dawes, Fahir Ö. Ergincan

De Bruijn and Kautz Bus networks

Science & Mathematics Published 1997 Verification Pending

Overview & Synopsis

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.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title De Bruijn and Kautz Bus networks
Author / Organization Jean-Claude Bermond, Robin Dawes, Fahir Ö. Ergincan
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 1997
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-107650
Original Source Link Visit Source Page on hal.science »