Routing on meshes in optimum time and with really small queues

Bogdan S. Chlebus, Jop F. Sibeyn

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

3 Scopus citations

Abstract

We consider permutation routing problems on 2D and 3D mesh-connected computers with side length n. Our main result is a deterministic online algorithm routing on 2D meshes, operating in worst-case time T = 2n + O(1) and with queue size Q = 3. We also develop offline routing algorithms with performance bounds T = 2n - 1 and Q = 2 for 2D meshes, and T = 3n - 2 and Q = 4 for 3D meshes. We also show that is it possible to route most of the permutations on 2D meshes offline in time T = 2n - 2 with Q = 1.

Original languageEnglish (US)
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)0769519261, 9780769519265
DOIs
StatePublished - Jan 1 2003
Externally publishedYes
EventInternational Parallel and Distributed Processing Symposium, IPDPS 2003 - Nice, France
Duration: Apr 22 2003Apr 26 2003

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Conference

ConferenceInternational Parallel and Distributed Processing Symposium, IPDPS 2003
CountryFrance
CityNice
Period4/22/034/26/03

    Fingerprint

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Software

Cite this

Chlebus, B. S., & Sibeyn, J. F. (2003). Routing on meshes in optimum time and with really small queues. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 [1213148] (Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS.2003.1213148