English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Sample Sort on Meshes

MPS-Authors
/persons/resource/persons45478

Sibeyn,  Jop
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dwp1i
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Sibeyn, J. (1997). Sample Sort on Meshes. In C. Lengauer, M. Griebl, & S. Gorlatch (Eds.), Euro-Par'97 Parallel Processing (pp. 389-398). Berlin: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-39A0-8
Abstract
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.