Shorter queues for permutation routing on meshes

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

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

Abstract

New deterministic algorithms for routing permutations on an n ×n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2·n-2 with a maximum queue length of 33. Another runs in the near-optimal time 2·n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.

Original languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings
EditorsIgor Privara, Branislav Rovan, Peter Ruzicka
PublisherSpringer Verlag
Pages597-607
Number of pages11
ISBN (Print)9783540583387
StatePublished - Jan 1 1994
Event19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994 - Kosice, Slovakia
Duration: Aug 22 1994Aug 26 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume841 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994
CountrySlovakia
CityKosice
Period8/22/948/26/94

Fingerprint

Queue
Permutation
Routing
Queue Length
Mesh
Deterministic Algorithm
Scattering
Data storage equipment

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sibeyn, J. F., Chlebus, B. S., & Kaufmann, M. (1994). Shorter queues for permutation routing on meshes. In I. Privara, B. Rovan, & P. Ruzicka (Eds.), Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings (pp. 597-607). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 841 LNCS). Springer Verlag.

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

Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings. ed. / Igor Privara; Branislav Rovan; Peter Ruzicka. Springer Verlag, 1994. p. 597-607 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 841 LNCS).

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

Sibeyn, JF, Chlebus, BS & Kaufmann, M 1994, Shorter queues for permutation routing on meshes. in I Privara, B Rovan & P Ruzicka (eds), Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 841 LNCS, Springer Verlag, pp. 597-607, 19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994, Kosice, Slovakia, 8/22/94.
Sibeyn JF, Chlebus BS, Kaufmann M. Shorter queues for permutation routing on meshes. In Privara I, Rovan B, Ruzicka P, editors, Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings. Springer Verlag. 1994. p. 597-607. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sibeyn, Jop F. ; Chlebus, Bogdan S. ; Kaufmann, Michael. / Shorter queues for permutation routing on meshes. Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings. editor / Igor Privara ; Branislav Rovan ; Peter Ruzicka. Springer Verlag, 1994. pp. 597-607 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{83be5aad682b46708341279833979b8f,
title = "Shorter queues for permutation routing on meshes",
abstract = "New deterministic algorithms for routing permutations on an n ×n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2·n-2 with a maximum queue length of 33. Another runs in the near-optimal time 2·n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.",
author = "Sibeyn, {Jop F.} and Chlebus, {Bogdan S.} and Michael Kaufmann",
year = "1994",
month = "1",
day = "1",
language = "English (US)",
isbn = "9783540583387",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "597--607",
editor = "Igor Privara and Branislav Rovan and Peter Ruzicka",
booktitle = "Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings",

}

TY - GEN

T1 - Shorter queues for permutation routing on meshes

AU - Sibeyn, Jop F.

AU - Chlebus, Bogdan S.

AU - Kaufmann, Michael

PY - 1994/1/1

Y1 - 1994/1/1

N2 - New deterministic algorithms for routing permutations on an n ×n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2·n-2 with a maximum queue length of 33. Another runs in the near-optimal time 2·n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.

AB - New deterministic algorithms for routing permutations on an n ×n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2·n-2 with a maximum queue length of 33. Another runs in the near-optimal time 2·n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.

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

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

M3 - Conference contribution

AN - SCOPUS:21844497019

SN - 9783540583387

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 597

EP - 607

BT - Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings

A2 - Privara, Igor

A2 - Rovan, Branislav

A2 - Ruzicka, Peter

PB - Springer Verlag

ER -