Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks (Q2885499): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q2094451
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ming-Xin He / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020716789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group-theoretic model for symmetric interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Action Graphs and Parallel Architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapped interconnection networks: Topological, performance, and robustness attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some mathematical properties of cayley digraphs with applications to interconnection network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully symmetric swapped networks based on bipartite cluster connectivity / rank
 
Normal rank

Latest revision as of 06:59, 5 July 2024

scientific article
Language Label Description Also known as
English
Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks
scientific article

    Statements

    Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite graph
    0 references
    Cayley graph/digraph
    0 references
    fault tolerance
    0 references
    Hamiltonian cycle
    0 references
    hierarchical network
    0 references
    interconnection network
    0 references
    internode distance
    0 references
    network diameter
    0 references
    node-disjoint paths
    0 references
    OTIS network
    0 references
    shortest-path routing
    0 references
    swapped network
    0 references
    0 references