Reducing complexity in tree-like computer interconnection networks

DOI10.1016/j.parco.2009.12.004zbMath1208.68053DBLPjournals/pc/NavaridasMRD10OpenAlexW2163392581WikidataQ58746952 ScholiaQ58746952MaRDI QIDQ991077

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

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

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

Related Items (1)

The average trapping time on a half Sierpinski gasket

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