Deterministic permutation routing on meshes

Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
Editors Anon
PublisherPubl by IEEE
Pages814-821
Number of pages8
ISBN (Print)081864222X
StatePublished - Dec 1 1993
Externally publishedYes
EventProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: Dec 1 1993Dec 4 1993

Publication series

NameProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

Conference

ConferenceProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
CityDallas, TX, USA
Period12/1/9312/4/93

Fingerprint

Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chlebus, B. S., Kaufmann, M., & Sibeyn, J. F. (1993). Deterministic permutation routing on meshes. In Anon (Ed.), Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing (pp. 814-821). (Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing). Publ by IEEE.

Deterministic permutation routing on meshes. / Chlebus, Bogdan S.; Kaufmann, Michael; Sibeyn, Jop F.

Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. ed. / Anon. Publ by IEEE, 1993. p. 814-821 (Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS, Kaufmann, M & Sibeyn, JF 1993, Deterministic permutation routing on meshes. in Anon (ed.), Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, Publ by IEEE, pp. 814-821, Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, USA, 12/1/93.
Chlebus BS, Kaufmann M, Sibeyn JF. Deterministic permutation routing on meshes. In Anon, editor, Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. Publ by IEEE. 1993. p. 814-821. (Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing).
Chlebus, Bogdan S. ; Kaufmann, Michael ; Sibeyn, Jop F. / Deterministic permutation routing on meshes. Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. editor / Anon. Publ by IEEE, 1993. pp. 814-821 (Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing).
@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 = "12",
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",

}

TY - GEN

T1 - Deterministic permutation routing on meshes

AU - Chlebus, Bogdan S.

AU - Kaufmann, Michael

AU - Sibeyn, Jop F.

PY - 1993/12/1

Y1 - 1993/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027885682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027885682&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027885682

SN - 081864222X

T3 - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

SP - 814

EP - 821

BT - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

A2 - Anon, null

PB - Publ by IEEE

ER -