Deutsch
 
Benutzerhandbuch Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Routing on the PADAM: Degrees of Optimality

MPG-Autoren
/persons/resource/persons44245

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

/persons/resource/persons44276

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

Sibeyn,  Jop F.
Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


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