Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (Q290192): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Generalized Hypercube and Hyperbus Structures for a Computer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lee distance and topological properties of k-ary n-cubes / 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: Complexity analysis of broadcasting in hypercubes with restricted communication capabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes / rank
 
Normal rank

Revision as of 01:56, 12 July 2024

scientific article
Language Label Description Also known as
English
Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
scientific article

    Statements

    Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (English)
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    interconnection networks
    0 references
    parallel processing
    0 references
    \(k\)-ary \(n\)-cubes
    0 references
    communication algorithms
    0 references

    Identifiers