The multi-level communication: Efficient routing for interconnection networks

DOI10.1023/A:1008160800606MaRDI QIDQ5934284zbMATH OpenOpenAlexFDO

Authors I. Sakho, M. B. Hadim

Publication date 2001

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008160800606

zbMATH Keywords

Eulerian cycle rulesrouting scheme

Mathematics Subject Classification ID

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

Recommendations

• Planar-adaptive routing
• A foundation for designing deadlock-free routing algorithms in wormhole networks
• scientific article; zbMATH DE number 1156659
• A generic design methodology for deadlock-free routing in multicomputer networks
• scientific article; zbMATH DE number 2206367

This page was built for publication: The multi-level communication: Efficient routing for interconnection networks

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