Title :
Deterministic permutation routing on meshes
Author :
Chlebus, Bogdan S. ; Kaufmann, Michael ; Sibeyn, Jop F.
Author_Institution :
Inst. Inf., Uniwersytet Warszawski, Poland
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
Keywords :
computational complexity; deterministic algorithms; multiprocessor interconnection networks; network routing; parallel algorithms; queueing theory; MIMD mesh; deterministic algorithms; near optimal time; optimal time; permutations; processing unit; Computer networks; Concurrent computing; Multiprocessor interconnection networks; Q measurement; Queueing analysis; Routing protocols; Scattering; Size measurement; Sorting; Time measurement;
Conference_Titel :
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-4222-X
DOI :
10.1109/SPDP.1993.395448
