Jean-Claude Bermond, Fahir Ö. Ergincan  Home/Search
Context Related
| inria.fr/sloop/personnel/Je...BeEr96.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sop.inria.fr/sloop/pers...bermond (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In bus interconnection networks every bus provides a communication medium between a set of processors. These networks are modeled by hypergraphs where vertices represent the processors and edges represent the buses. We survey the results obtained on the construction methods that connect a large number of processors in a bus network with given maximum processor degree \Delta, maximum bus size r, and network diameter D. (In hypergraph terminology this problem is known as the (\Delta; D;... (Update)
Context of citations to this paper: More
...been studied extensively. Mickunas [22] considered the case when k and r are close to equal. Subsequently, Bermond and his colleagues [4, 5, 6] considered general network design problems of this type under the name bus interconnection networks . They are primarily responsible...
...studied extensively. Mickunas [101] considered the case when k and r are close to equal. Subsequently, Bermond and his colleagues [92, 93, 94] considered general network design problems of this type under the name bus interconnection networks . They are primarily responsible...
Cited by: More
Moore Graphs and Beyond: - The (Correct)
Broadcasting In Bus Interconnection Networks - Ferreira (1999) (Correct)
Two Constructions for Making Partitionable Graphs - Pecher (2001) (Correct)
Similar documents (at the sentence level):
69.2%: Bus Interconnection Networks - Jean-Claude Bermond Fahir (1996) (Correct)
5.1%: De Bruijn and Kautz Bus Networks - Bermond, Dawes, Ergincan (Correct)
Active bibliography (related documents): More All
0.9: Applications of Combinatorial Designs to Communications, .. - Colbourn, Dinitz.. (1999) (Correct)
0.9: Projective Planes and Congestion-Free Networks - Colbourn (1998) (Correct)
0.6: Distributed Scheduling for Disconnected Cooperation - Malewicz (2003) (Correct)
Similar documents based on text: More All
0.3: De Bruijn and Kautz Bus Networks Jean-Claude Bermond - Cnrs Universit'e De (Correct)
0.1: Broadcasting in Bus Interconnection Networks - Ferreira Goldman (1994) (Correct)
0.1: Mean Eccentricities of de Bruijn Networks - Bermond, Liu (1993) (Correct)
Related documents from co-citation: More All
2: Graphs and interconnection networks: diameter and vulnerability (context) - Bermond, Bond et al. - 1983
2: Some maximal arcs in finite projective planes (context) - Denniston - 1969
2: Maximum degree and fractional matchings in uniform hypergraphs (context) - Furedi - 1981
BibTeX entry: (Update)
J.-C. Bermond and F. O. Ergincan, Bus interconnection networks, Discrete Applied Math. 68 (1996), 1-15. http://citeseer.ist.psu.edu/255101.html More
@article{ bermond96bus,
author = "Bermond and Ergincan",
title = "Bus Interconnection Networks",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "68",
year = "1996",
url = "citeseer.ist.psu.edu/255101.html" }
Citations (may not include all citations):113 North-Holland (context) - Berge - 1989
111 Distance-Regular Graphs (context) - Brouwer, Cohen et al. - 1989
96 Generalized hypercube and hyperbus structures for a computer.. (context) - Bhuyan, Agrawal - 1984
64 Parallel computations on reconfigurable meshes (context) - Miller, Kumar et al. - 1993
48 Array processor with multiple broadcasting (context) - Kumar, Raghavendra - 1987
41 Strategies for interconnection networks: some methods from g.. (context) - Bermond, Delorme et al. - 1986
38 de Bruijn multiprocessor network: a versatile parallel proce.. (context) - Samatham, Pradhan - 1989
33 Communication structures for large networks of microcomputer.. (context) - Wittie - 1981
29 de Bruijn and Kautz networks: a competitor for the hypercube (context) - Bermond, Peyrat - 1989
23 Cambridge University Press (context) - Hughes, Piper - 1988
21 Meshes with multiple buses (context) - Stout - 1986
16 fully distributed parallel machine (context) - Sullivan, Bashkow et al. - 1977
14 Applications of combinatorial designs in computer science (context) - Colbourn, Van Oorschot - 1989
10 Dense bipartite digraphs (context) - Fiol, Yebra - 1990
9 Processor interconnection strategies (context) - Finkel, Solomon - 1980
8 Bused hypercubes and other pin-optimal networks (context) - Fiduccia - 1992
7 The organization of permutation architectures with bused int.. (context) - Kilian, Kipnis et al. - 1990
6 Interconnection networks with each node on two buses (context) - Bermond, Bond et al. - 1986
5 Diameters of communication networks (context) - Chung - 1986
5 Research and Development (context) - Hoffman, Singleton et al. - 1960
5 Automorphism groups of graphs (context) - Cameron - 1983
5 Graphs and interconnection networks: diameter and vulnerabil.. (context) - Bermond, Bond et al. - 1983
4 The maximum number of edges in 2K 2 -free graphs of bounded .. (context) - Chung, Gy'arf'as et al. - 1990
4 Using projective geometry to design bus connection networks (context) - Mickunas - 1980
4 The non-existence of rank three permutation groups of degree.. (context) - Aschbacher - 1971
4 New large bipartite graphs with given degree and diameter (context) - Bond, Delorme - 1988
4 Maximum degree and fractional matchings in uniform hypergrap.. (context) - Furedi - 1981
3 Large graphs with given degree and diameter - part (context) - Delorme, Farhi - 1984
3 On Moore geometries (context) - Damerell, Georgiacodis - 1981
3 On Moore geometries (context) - Damerell - 1981
3 Special issue in Networks (context) - Hsu, Networks - 1993
3 Directed Moore hypergraphs (context) - Ergincan, Gregory - 1992
3 The lens interconnection strategy (context) - Finkel, Solomon - 1981
2 Table of large (context) - Bermond, Delorme et al. - 1992
2 Design of multicast multilayered lightwave networks (context) - Jiang, Stern et al.
2 Directed line hypergraphs (context) - Bermond, Ergincan
2 Dense bus connection networks (context) - Doty - 1983
2 On regular packings and coverings (context) - Bermond, Bond et al. - 1987
2 The nonexistence of Moore geometries of diameter (context) - Fuglister - 1983
2 Design machines: algebraically well described interconnectio.. (context) - Beth, Hatz - 1992
2 Fault-tolerant multiprocessor link and bus network architect.. (context) - Pradhan - 1985
1 Reliable bus-network architectures based on block design (context) - Ozawa - 1986
1 The maximum number of edges in regular 2K 2 -free graphs (context) - Paoli, Peck et al.
1 A generalization of Moore graphs of diameter (context) - Bose, Dowling - 1971
1 Special issue in Discrete App (context) - Bermond, Networks - 1992
1 submitted to Networks (context) - Bermond, Dawes et al.
1 manuscript in preparation (context) - Bermond, Bond et al.
1 On finite Moore geometries (context) - Fuglister - 1977
1 Connectivity of bus networks (context) - Bermond, Ergincan
1 Moore geometries and rank 3 groups having (context) - Kantor - 1977
1 ese de Docteur d (context) - Bond, d'interconnexion et al. - 1987
1 Etude de Certains R'eseaux d'Interconnexion: Structure et Co.. (context) - Djelloul - 1993
1 Towards massively parallel systems: bus based parallel compu.. (context) - Ferreira, vel et al. - 1993
Documents on the same site (http://www-sop.inria.fr/sloop/personnel/Jean-Claude.Bermond/bermond.html): More
A Note on Knödel Graphs - Bermond, Liestman (Correct)
De Bruijn and Kautz Bus Networks - Bermond, Dawes, Ergincan (Correct)
Fast Gossiping by Short Messages - Bermond, Gargano, al. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC