Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems

DOI10.1002/(SICI)1097-0037(200001)35:1%3C56::AID-NET5%3E3.0.CO;2-DMaRDI QIDQ4944742zbMATH OpenOpenAlexFDO

Authors Gen-Huey Chen, Jung-Sheng Fu, Jywe-Fei Fang

Publication date 27 June 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(200001)35:1%3C56::aid-net5%3E3.0.co;2-d

zbMATH Keywords

ascend/descend algorithmsbroadcasting algorithmdiameterembeddingHamiltonian-connectedhypercompleteinterconnection topologylarge-scale distributed multicomputer systemspancyclic recursive topologyshortest pathspanning tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1332755
• Recursive circulants and their embeddings among hypercubes
• Multiplicative circulant networks. Topological properties and communication algorithms
• Hierarchical spanning trees and distributing on incomplete hypercubes
• Routing multiple paths in hypercubes

Cites work

• Arrangement graphs: A class of generalized star graphs
• Parallel Processing with the Perfect Shuffle
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

Cited in

(12)

• Edge-pancyclicity of recursive circulants
• Survey on path and cycle embedding in some networks
• The cylindrical banyan multicomputer: A reconfigurable systolic architecture
• The Hamiltonian connectivity of rectangular supergrid graphs
• Node-disjoint paths in a level block of generalized hierarchical completely connected networks
• Vertex-bipancyclicity of the generalized honeycomb tori
• On embedding cycles into faulty twisted cubes
• scientific article; zbMATH DE number 1304103 (Why is no real title available?)
• On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network
• Edge-fault-tolerant vertex-pancyclicity of augmented cubes
• Vertex-pancyclicity of augmented cubes with maximal faulty edges
• Conditional fault Hamiltonicity of the complete graph

This page was built for publication: Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems

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