An empirical study of off-line permutation packet routing on two-dimensional meshes based on the multistage routing method

DOI10.1109/12.509915zbMATH Open1068.68633OpenAlexW2156653682MaRDI QIDQ4420971FDOQ4420971

Authors: Antonios Symvonis, Jonathon E. Tidswell 

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/569a8dc29a66e780b73fb835eec61178d66c8e77

Recommendations

• Packet Routing on grids of processors
• Deterministic Permutation Routing on Meshes
• Off‐line permutation routing on circuit‐switched fixed‐routing networks
• Constant queue routing on a mesh
• Almost optimal permutation routing on hypercubes

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (1)

• A note on deflection worm routing on meshes.

This page was built for publication: An empirical study of off-line permutation packet routing on two-dimensional meshes based on the multistage routing method

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