Bus interconnection networks

DOI10.1016/0166-218X(95)00046-TMaRDI QIDQ1917343zbMATH OpenOpenAlexFDO

Authors Fahir Ö. Ergincan, Jean-Claude Bermond

Publication date 25 November 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(95)00046-t

zbMATH Keywords

bus interconnection networksbus networkshypergraphsnetwork diameterpoint-to-point networksprocessors

Mathematics Subject Classification ID

Hypergraphs (05C65) Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Recommendations

• De Bruijn and Kautz bus networks
• scientific article; zbMATH DE number 568784
• Connectivity and fault-tolerance of hyperdigraphs

Cites work

• A generalization of Moore graphs of diameter two
• De Bruijn and Kautz bus networks
• Dense bipartite digraphs
• Directed Moore hypergraphs
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• GOSSIPING IN BUS INTERCONNECTION NETWORKS
• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• scientific article; zbMATH DE number 3851135 (Why is no real title available?)
• scientific article; zbMATH DE number 3891413 (Why is no real title available?)
• scientific article; zbMATH DE number 3959292 (Why is no real title available?)
• scientific article; zbMATH DE number 4043770 (Why is no real title available?)
• scientific article; zbMATH DE number 4049679 (Why is no real title available?)
• scientific article; zbMATH DE number 4059445 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 54299 (Why is no real title available?)
• scientific article; zbMATH DE number 194140 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 568784 (Why is no real title available?)
• scientific article; zbMATH DE number 3308122 (Why is no real title available?)
• Large Graphs with Given Degree and Diameter—Part I
• Large regular graphs with no induced \(2K_ 2\)
• Maximum degree and fractional matchings in uniform hypergraphs
• MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
• On finite Moore geometries
• On Moore Geometries, I
• On Moore geometries. II
• On Moore Graphs with Diameters 2 and 3
• Parallel computations on reconfigurable meshes
• Processor Interconnection Strategies
• Table of large \(({\Delta{}}, D)\)-graphs
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The nonexistence of Moore geometries of diameter 4
• The nonexistence of rank three permutation groups of degree 3250 and subdegree 57

Cited in

(11)

• Connectivity and fault-tolerance of hyperdigraphs
• Dual of a complete graph as an interconnection network
• Projective planes and congestion-free networks
• A bus-based semi-completely-connected network for high-performance on-chip systems
• scientific article; zbMATH DE number 4043770 (Why is no real title available?)
• scientific article; zbMATH DE number 568784 (Why is no real title available?)
• De Bruijn and Kautz bus networks
• Optimal realization of sets of interconnection functions on synchronous multiple bus systems
• Partial line directed hypergraphs
• scientific article; zbMATH DE number 828044 (Why is no real title available?)
• Eulerian and Hamiltonian dicycles in directed hypergraphs

This page was built for publication: Bus interconnection networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917343)