Deterministic on-line routing on area-universal networks

DOI10.1145/210346.210417zbMath0885.68029OpenAlexW2030566444MaRDI QIDQ4369878

Gianfranco Bilardi, Paul Bay

Publication date: 28 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/7077

zbMATH Keywords

deterministic routing networkspruned butterflysorting fat-tree

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items

Real-time emulations of bounded-degree networks ⋮ Area-time tradeoffs for universal VLSI circuits ⋮ UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS ⋮ Implementing shared memory on mesh-connected computers and on the fat-tree