PERFORMANCE ANALYSIS OF WORMHOLE ROUTED K-Ary N-TREES

DOI10.1142/S012905419800012XzbMath1319.68043MaRDI QIDQ5248972

Fabrizio Petrini, Marco Vanneschi

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

interconnection networksroutingflow controlvirtual channelsfat-trees\(k\)-ary \(n\)-treescongestion-free patterns

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Fat-tree routing and node ordering providing contention free traffic for MPI global collectives

Cites Work

• Communication-efficient parallel algorithms for distributed random-access machines
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

This page was built for publication: PERFORMANCE ANALYSIS OF WORMHOLE ROUTED K-Ary N-TREES