Reducing complexity in tree-like computer interconnection networks

DOI10.1016/J.PARCO.2009.12.004MaRDI QIDQ991077zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Javier Navaridas, Jose Miguel-Alonso, Francisco Javier Ridruejo, Wolfgang Denzel

Publication date 2 September 2010

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.parco.2009.12.004

zbMATH Keywords

simulationperformance evaluationtraffic characterization\(k\)-ary \(n\)-tree topology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Cost-performance tradeoffs for interconnection networks
• Interconnection network organization and its impact on performance and cost in shared memory multiprocessors
• Performance analysis of wormhole routed \(k\)-ary \(n\)-trees
• scientific article; zbMATH DE number 1151834
• Comparing four classes of torus-based parallel architectures: network parameters and communication performance

Cited in

(3)

• The average trapping time on a half Sierpinski gasket
• Realizability problem of distance-edge-monitoring numbers
• Reducing complexity of the distributed switch for parallel data processing systems

This page was built for publication: Reducing complexity in tree-like computer interconnection networks

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