de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Routing on the PADAM: Degrees of Optimality

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44245

Chlebus,  Bogdan S.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44276

Czumaj,  Artur
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn,  Jop F.
Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Chlebus, B. S., Czumaj, A., & Sibeyn, J. F. (1997). Routing on the PADAM: Degrees of Optimality. In C. Lengauer, M. Griebl, & S. Gorlatch (Eds.), Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97) (pp. 272-279). Berlin: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3998-B
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.