Minimal‐distance routing for KYKLOS II

DOI10.1002/NET.3230240207zbMATH Open0795.68006OpenAlexW1993145821MaRDI QIDQ4285461FDOQ4285461

Authors: Du Ding-Zhu, Frank K. Hwang, Andrew Odlyzko, Yanjun Zhang 

Publication date: 24 March 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240207

Recommendations

• Routing in series parallel networks
• Optimal routing in toroidal networks
• Packet Routing on grids of processors
• Optimal multi-packet routing on the torus
• The search for an optimal multiprocessor interconnection network

zbMATH Keywords

double binary treeKYKLOSminimal-distance routingmultiprocessor interconnection network

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Network design and communication in computer systems (68M10)

This page was built for publication: Minimal‐distance routing for KYKLOS II

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