Flit-serial packet routing on meshes and tori

DOI10.1007/BF01192690zbMath1111.68330OpenAlexW2097741521MaRDI QIDQ3445270

Fillia Makedon, Antonios Symvonis

Publication date: 11 June 2007

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192690

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

Routing with critical paths ⋮ A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs ⋮ Searching and pebbling

Cites Work

• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• Optimal routing algorithms for mesh-connected processor arrays
• Constant queue routing on a mesh
• Deterministic Permutation Routing on Meshes
• Fast algorithms for bit-serial routing on a hypercube
• Sorting on a mesh-connected parallel computer
• Virtual cut-through: A new computer communication switching technique
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

This page was built for publication: Flit-serial packet routing on meshes and tori