Abstract
In this paper we present efficient algorithms for sorting on the The Parallel Disks Model (PDM). Numerous asymptotically optimal algorithms have been proposed in the literature. However many of them have large underlying constants in the time bounds. We present practical and optimal algorithms in this paper. We have implemented these algorithms and evaluated their performance. Experimental data are very promising. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Kundeti, V., & Rajasekaran, S. (2008). Efficient PDM sorting algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5374 LNCS, pp. 97–107). Springer Verlag. https://doi.org/10.1007/978-3-540-89894-8_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
