de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Sample Sort on Meshes

MPG-Autoren

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

Sibeyn, J. F. (1997). Sample Sort on Meshes. In C. Lengauer, M. Griebl, & S. Gorlatch (Eds.), Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97) (pp. 389-398). Berlin: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-39A0-8
Zusammenfassung
Sorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms are so large that they dominate the overall time-consumption for many practical problem sizes. Particularly for deterministic algorithms, this is a serious problem. In this paper a refined deterministic sampling strategy is presented, by which the additional term of the presented deterministic sorting algorithm is hardly larger than the one of the best randomized algorithm.