Adaptive wormhole routing in hypercube multicomputers

DOI10.1006/JPDC.1997.1417zbMATH Open0897.68017OpenAlexW1970847468MaRDI QIDQ1388143

D. Massart

Publication date: 3 August 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/84b96e11011d5b0c6454feea23befaa90a010520

zbMATH Keywords

distributed-memory multiprocessorsadaptive unicast routingefficient multicast communication

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Related Items (5)

Optimal fully adaptive minimal wormhole routing for meshes ⋮ Title not available (Why is that?) ⋮ Performance tuning of adaptive wormhole routing through selection function choice ⋮ A theory of wormhole routing in parallel computers ⋮ An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

This page was built for publication: Adaptive wormhole routing in hypercube multicomputers

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