@inproceedings{3320a4dc7fc940cb82db06746cd5e827,

title = "Deterministic permutation routing on meshes",

abstract = "We present new deterministic algorithms for routing permutations on a two-dimensional n×n MIMD mesh. One algorithm runs in the optimal time 2·n-2, while the maximal number of packets stored in a processing unit is bounded to 81. Another algorithm runs in near-optimal time, 2·n+O(1), and has maximal queue length only 31.",

author = "Chlebus, {Bogdan S.} and Michael Kaufmann and Sibeyn, {Jop F.}",

year = "1993",

month = dec,

day = "1",

language = "English (US)",

isbn = "081864222X",

series = "Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing",

publisher = "Publ by IEEE",

pages = "814--821",

editor = "Anon",

booktitle = "Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing",

note = "Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing ; Conference date: 01-12-1993 Through 04-12-1993",

}