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.
This research has been supported in part by the NSF Grant ITR-0326155 and a UTC endowment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., Plaxton, G.: Optimal parallel sorting in multi-level storage. In: Proc. of the ACM-SIAM SODA 1994, pp. 659–668 (1994)
Aggarwal, A., Vitter, J.S.: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM 31(9), 1116–1127 (1988)
Arge, L.: The Buffer Tree: A New Technique for Optimal I/O-Algorithms. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 334–345. Springer, Heidelberg (1995)
Barve, R., Grove, E.F., Vitter, J.S.: Simple Randomized Mergesort on Parallel Disks. Parallel Computing 23(4-5), 601–631 (1997)
Dementiev, R., Sanders, P.: Asynchronous Parallel Disk Sorting. In: Proc. ACM Symposium on Parallel Algorithms and Architectures, pp. 138–148 (2003)
Horowitz, E., Sahni, S., Rajasekaran, S.: Computer Algorithms. W. H. Freeman Press, New York (1998)
Hutchinson, D., Sanders, P., Vitter, J.: Duality between prefetching and queued writing with parallel disks. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 62–73. Springer, Heidelberg (2001)
Nodine, M., Vitter, J.: Deterministic distribution sort in shared and distributed memory multirocessors. In: Proc. of the ACM SPAA 1993, pp. 120–129 (1993), http://www.cs.duke.edu/~jsv/Papers/catalog/node16.html
Nodine, M.H., Vitter, J.S.: Greed Sort: Optimal Deterministic Sorting on Parallel Disks. Journal of the ACM 42(4), 919–933 (1995)
Rajasekaran, S.: A Framework for Simple Sorting Algorithms on Parallel Disk Systems. Theory of Computing Systems 34(2), 101–114 (2001)
Rajasekaran, S., Sen, S.: Optimal and Practical Algorithms for Sorting on the PDM. IEEE Transactions on Computers 57(4) (2008)
Rajasekaran, S., Sen, S.: PDM Sorting Algorithms That Take A Small Number Of Passes. In: Proc. International Parallel and Distributed Processing Symposium (IPDPS) (2005)
Rajasekaran, S., Sen, S.: A Simple Optimal Randomized Sorting Algorithm for the PDM. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 543–552. Springer, Heidelberg (2005)
Sanders, P., Enger, S., Korst, J.: Fast concurrent access to parallel disks. In: Proc. of the ACM-SIAM SODA 2000, pp. 849–858 (2000)
Vitter, J.S., Hutchinson, D.A.: Distribution Sort with Randomized Cycling. In: Proc. 12th Annual SIAM/ACM Symposium on Discrete Algorithms (2001)
Vitter, J.S., Shriver, E.A.M.: Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica 12(2-3), 110–147 (1994)
Stevens, W.R., Rago, S.A.: Advanced Programming in the UNIX Environment, 2nd edn. Addison-Wesley Professional Computing Series (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kundeti, V., Rajasekaran, S. (2008). Efficient PDM Sorting Algorithms. In: Sadayappan, P., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2008. HiPC 2008. Lecture Notes in Computer Science, vol 5374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89894-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-89894-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89893-1
Online ISBN: 978-3-540-89894-8
eBook Packages: Computer ScienceComputer Science (R0)