Generalized Hypercube and Hyperbus Structures for a Computer Network

DOI10.1109/TC.1984.1676437zbMATH Open0528.68002MaRDI QIDQ3309028FDOQ3309028

Publication date: 1984

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

topological optimization parallel computers local area networks 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)

Cited In (94)

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

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

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