Access the full text.
Sign up today, get DeepDyve free for 14 days.
Bermond Bermond, Homobono Homobono, Peyrat Peyrat (1989)
Large fault‐tolerant interconnection networksGraphs Combin., 5
Ergincan Ergincan, Gregory Gregory (1995)
Directed Moore hypergraphsDiscr. Appl. Math., 63
Bermond Bermond, Ergincan Ergincan (1996)
Bus interconnection networksDiscr. Appl. Math., 68
Chung Chung (1986)
Diameters of communication networksAMS Proceedings of Symposia in Applied Mathematics, 34
Imase Imase, Itoh Itoh (1983)
A design for directed graphs with minimum diameterIEEE Trans. Comput., C‐32
Bermond Bermond, Delorme Delorme, Quisquater Quisquater (1986)
Strategies for interconnection networks: Some methods from graph theoryJ. Parallel Distrib. Process., 3
Fiol Fiol, Yebra Yebra, de Miquel de Miquel (1984)
Line digraph iterations and the ( d , k ) digraph problemIEEE Trans. Comput., C‐33
Samatham Samatham, Pradhan Pradhan (1989)
The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSIIEEE Trans. Comput., 38
Imase Imase, Itoh Itoh (1981)
Design to minimize diameter on building‐block networkIEEE Trans. Comput., C‐30
Fiol Fiol, Yebra Yebra (1990)
Dense bipartite digraphsJ. Graph Theory, 14
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
Networks: An International Journal – Wiley
Published: Oct 1, 1997
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.