A note on deflection worm routing on meshes

Abstract We prove the existence of asymptotically optimal routing schedules for deflection worm routing of permutations on n × n meshes. We achieve this by deriving an off-line algorithm which routes permutations in O(kn) steps where k is the number of flits of a worm. The best to date off-line algorithms for deflection worm routing of permutations were due t