Stirling networks: A versatile combinatorial topology for multiprocessor systems (Q1199419): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Group Graphs and Their Fault Tolerance / 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: Q3484355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Diagnosis in a Boolean n Cube Array of Microprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for constructing minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large fault-tolerant interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Hypercube and Hyperbus Structures for a Computer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulants and their connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forwarding index of communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock-Free Message Routing in Multiprocessor Interconnection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheel-augmented binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel graph algorithms for hypercube computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two minimum spanning forest algorithms on fixed-size hypercube computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3310647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binomial Coefficients Modulo a Prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual cut-through: A new computer communication switching technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault diameter of interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental distance and diameter sequences of a graph: new measures of network performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding fundamental cycles and bridges on a tree-structured parallel computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph algorithms on a tree-structured parallel computer / rank
 
Normal rank

Latest revision as of 16:15, 16 May 2024

scientific article
Language Label Description Also known as
English
Stirling networks: A versatile combinatorial topology for multiprocessor systems
scientific article

    Statements

    Stirling networks: A versatile combinatorial topology for multiprocessor systems (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Stirling graph tree
    0 references
    embedding routing algorithm
    0 references
    path
    0 references
    cycle
    0 references
    Stirling table
    0 references
    multiprocessor interconnection networks
    0 references
    Stirling network
    0 references
    trees
    0 references
    combinatorial networks
    0 references
    routing scheme
    0 references
    labels
    0 references
    VLSI
    0 references
    layout
    0 references
    vulnerability
    0 references
    fault-handling
    0 references
    parallel algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references