Routing on the PADAM: Degrees of optimality

Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn

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

5 Scopus citations

Abstract

Routing problems are studied for the Parallel Alternating-Direction Access Machine. The goal is to investigate what level of optimality can be achieved depending on loads of packets per memory unit. In the case of typical moderate loads, our algorithms are optimal to within a small multiplicative constant; a deterministic and a randomized algorithm are developed, both faster than the best previously known routing algorithm. Moreover, for sufficiently large loads, an algorithm which misses optimality by only an additive lower-order term is designed. We consider also off-line routing problems, and multidimensional extension of the model.

Original languageEnglish (US)
Title of host publicationEuro-Par 1997 Parallel Processing - Third International Conference, Proceedings
Pages272-279
Number of pages8
Publication statusPublished - Dec 1 1997
Externally publishedYes
Event3rd International Conference on Parallel Processing, Euro-Par 1997 - Passau, Germany
Duration: Aug 26 1997Aug 29 1997

Publication series

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

Conference

Conference3rd International Conference on Parallel Processing, Euro-Par 1997
CountryGermany
CityPassau
Period8/26/978/29/97

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., Czumaj, A., & Sibeyn, J. F. (1997). Routing on the PADAM: Degrees of optimality. In Euro-Par 1997 Parallel Processing - Third International Conference, Proceedings (pp. 272-279). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1300 LNCS).