Generalized Hypercube and Hyperbus Structures for a Computer Network

DOI10.1109/TC.1984.1676437MaRDI QIDQ3309028zbMATH OpenFDO

Authors Laxmi N. Bhuyan, Dharma P. Agrawal

Publication date 1984

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

Full work available at URL https://doi.org/10.1109/TC.1984.1676437

zbMATH Keywords

distributed computershyperbus structureshypercube structureslocal area networksmultistage interconnection networksparallel computerstopological optimization

Mathematics Subject Classification ID

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

Cited in

(only showing first 100 items - show all)

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

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)