Generalized Hypercube and Hyperbus Structures for a Computer Network

DOI10.1109/TC.1984.1676437zbMath0528.68002MaRDI QIDQ3309028

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

parallel computers local area networks topological optimization multistage interconnection networks hypercube structures distributed computers hyperbus structures

Mathematics Subject Classification ID

Circuits, networks (94C99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Related Items (94)

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes ⋮ Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ Embedding cycles in IEH graphs ⋮ Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks ⋮ Restricted connectivity for three families of interconnection networks ⋮ Data center interconnection networks are not hyperbolic ⋮ Combinatorial properties of generalized hypercube graphs ⋮ Randomized routing on generalized hypercubes ⋮ The \((n,k)\)-star graph: A generalized star graph ⋮ EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ IEH graphs. A novel generalization of hypercube graphs ⋮ On some properties of doughnut graphs ⋮ GOSSIPING IN BUS INTERCONNECTION NETWORKS ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ Containment properties of product and power graphs ⋮ Supercube: An optimally fault tolerant network architecture ⋮ Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ Bus interconnection networks ⋮ The bipanconnectivity of bipartite hypercube-like networks ⋮ Incrementally extensible hypercube networks and their fault tolerance ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Conditional edge-fault pancyclicity of augmented cubes ⋮ Two spanning disjoint paths with required length in generalized hypercubes ⋮ Cycles in butterfly graphs ⋮ The family of generalized variational network of cube-connected cycles ⋮ Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube ⋮ Conditional diagnosability of component-composition graphs under the PMC model ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency ⋮ Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction ⋮ The folded Petersen network: A new versatile multiprocessor interconnection topology ⋮ Linear layouts of generalized hypercubes ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Reliabilities for two kinds of graphs with smaller diameters ⋮ Symmetric property and reliability of locally twisted cubes ⋮ SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK ⋮ Hypercube embedding heuristics: An evaluation ⋮ On some super fault-tolerant Hamiltonian graphs ⋮ Graph theoretic characterization and reliability of the multiple-clique network ⋮ The \(h\)-restricted connectivity of the generalized hypercubes ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory ⋮ RVCCC: a new variational network of cube-connected cycles and its topological properties ⋮ Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes ⋮ Cube-like incidence complexes and their groups ⋮ A new family of trivalent Cayley networks on wreath product \(Z_{m}\wr S_{n}^\ast\) ⋮ Embedding even cycles on folded hypercubes with conditional faulty edges ⋮ Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults ⋮ A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices ⋮ Trivalent Cayley graphs for interconnection networks ⋮ Edge-bipancyclicity of a hypercube with faulty vertices and edges ⋮ The generalized 3-connectivity of two kinds of regular networks ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube ⋮ Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\) ⋮ Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ Lazy Cops and Robbers on generalized hypercubes ⋮ An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links ⋮ Dynamic processor allocation in scalable multiprocessors using boolean algebra^* ⋮ 1-vertex-fault-tolerant cycles embedding on folded hypercubes ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs ⋮ On embedding cycles into faulty twisted cubes ⋮ Mapping finite element graphs on hypercubes ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ A further result on fault-free cycles in faulty folded hypercubes ⋮ Cycle embedding of augmented cubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ The independence number for de Bruijn networks and Kautz networks ⋮ On the complexity of the embedding problem for hypercube related graphs ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ An extended generalized hypercube as a fault-tolerant system area network for multiprocessor systems ⋮ Topological properties of supercube ⋮ Two coloring problems on matrix graphs ⋮ Fault-tolerant cycles embedding in folded hypercubes ⋮ Topological properties of twisted cube ⋮ Solving elliptic partial differential equations on the hypercube multiprocessor ⋮ On the communication structures of hyper-ring and hypercube multicomputers ⋮ On thek-ary hypercube tree and its average distance ⋮ Unnamed Item ⋮ Recognition of handwritten Hindu numerals using structural descriptors ⋮ Cycles in folded hypercubes with two adjacent faulty vertices ⋮ Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes ⋮ An upper bound for the crossing number of augmented cubes ⋮ Gossip Latin square and the meet-all gossipers problem ⋮ Reliability analysis of the generalized balanced hypercube ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks

This page was built for publication: Generalized Hypercube and Hyperbus Structures for a Computer Network