
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sanguthevar Rajasekaran, Sandeep Sen, "Optimal and Practical Algorithms for Sorting on the PDM," IEEE Transactions on Computers, vol. 57, no. 4, pp. 547561, April, 2008.  
BibTex  x  
@article{ 10.1109/TC.2007.70810, author = {Sanguthevar Rajasekaran and Sandeep Sen}, title = {Optimal and Practical Algorithms for Sorting on the PDM}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {4}, issn = {00189340}, year = {2008}, pages = {547561}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70810}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimal and Practical Algorithms for Sorting on the PDM IS  4 SN  00189340 SP547 EP561 EPD  547561 A1  Sanguthevar Rajasekaran, A1  Sandeep Sen, PY  2008 VL  57 JA  IEEE Transactions on Computers ER   
[1] A. Aggarwal and G. Plaxton, “Optimal Parallel Sorting in MultiLevel Storage,” Proc. ACMSIAM Symp. Discrete Algorithms, pp.659668.
[2] A. Aggarwal and J.S. Vitter, “The Input/Output Complexity of Sorting and Related Problems,” Comm. ACM, vol. 31, no. 9, pp.11161127, 1988.
[3] L. Arge, “The Buffer Tree: A New Technique for Optimal I/OAlgorithms,” Proc. Fourth Int'l Workshop Algorithms and Data Structures, pp. 334345, 1995.
[4] L. Arge, P. Ferragina, R. Grossi, and J.S. Vitter, “On Sorting Strings in External Memory,” Proc. ACM Symp. Theory of Computing, 1995.
[5] L. Arge, M. Knudsen, and K. Larsen, “A General Lower Bound on the I/OComplexity of ComparisonBased Algorithms,” Proc. Third Workshop Algorithms and Data Structures, 1993.
[6] R. Barve, E.F. Grove, and J.S. Vitter, “Simple Randomized Mergesort on Parallel Disks,” Parallel Computing, vol. 23, nos. 45, pp. 601631, 1997.
[7] K. Batcher, “Sorting Networks and Their Applications,” Proc. AFIPS Spring Joint Computing Conf., vol. 32, pp. 307314, 1968.
[8] G. Chaudhry and T.H. Cormen, “Getting More from OutofCore Columnsort,” Proc. Fourth Workshop Algorithm Eng. and Experiments, pp. 143154, 2002.
[9] G. Chaudhry, T.H. Cormen, and E.A. Hamon, “Parallel OutofCore Sorting: The Third Way,” Cluster Computing, to appear.
[10] G. Chaudhry, T.H. Cormen, and L.F. Wisniewski, “Columnsort Lives! An Efficient OutofCore Sorting Program,” Proc. 13th Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 169178, 2001.
[11] R. Dementiev and P. Sanders, “Asynchronous Parallel Disk Sorting,” Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 138148, 2003.
[12] E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms. W.H.Freeman, 1998.
[13] D. Hutchinson, P. Sanders, and J. Vitter, “Duality between Prefetching and Queued Writing with Parallel Disks,” Proc. Ninth European Symp. Algorithms, pp. 6273, 2001.
[14] T. Leighton, “Tight Bounds on the Complexity of Parallel Sorting,” IEEE Trans. Computers, vol. 34, no. 4, pp. 344354, Apr. 1985.
[15] Y. Ma, S. Sen, and D. Scherson, “The Distance Bound for Sorting on Mesh Connected Processor Arrays Is Tight,” Proc. 27th Symp. Foundations of Computer Science, pp. 255263, 1986.
[16] J.M. Marberg and E. Gafni, “Sorting in Constant Number of Row and Column Phases on a Mesh,” Algorithmica, vol. 3, no. 4, pp.561572, 1988.
[17] M. Nodine and J. Vitter, “Deterministic Distribution Sort in Shared and Distributed Memory Multirocessors,” Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 120129, http://www.cs.duke.edu/ jsv/Papers/catalog node16.html, 1993.
[18] M.H. Nodine and J.S. Vitter, “Greed Sort: Optimal Deterministic Sorting on Parallel Disks,” J. ACM, vol. 42, no. 4, pp. 919933, 1995.
[19] S. Rajasekaran, “Sorting and Selection on Interconnection Networks,” DIMACS Series in Discrete Math. and Theoretical Computer Science, vol. 21, pp. 275296, 1995.
[20] S. Rajasekaran, “A Framework for Simple Sorting Algorithms on Parallel Disk Systems,” Theory of Computing Systems, vol. 34, no. 2, pp. 101114, 2001.
[21] S. Rajasekaran and S. Sen, “PDM Sorting Algorithms that Take a Small Number of Passes,” Proc. Int'l Parallel and Distributed Processing Symp., 2005.
[22] S. Rajasekaran and S. Sen, “A Simple Optimal Randomized Sorting Algorithm for the PDM,” Proc. Int'l Symp. Algorithms and Computation, pp. 543552, 2005.
[23] P. Sanders, S. Enger, and J. Korst, “Fast Concurrent Access to Parallel Disks,” Proc. ACMSIAM Symp. Discrete Algorithms, pp.849858.
[24] I.D. Scherson, S. Sen, and A. Shamir, “Shear Sort: A True TwoDimensional Sorting Technique for VLSI Networks,” Proc. Int'l Conf. Parallel Processing, pp. 903908, 1986.
[25] C.P. Schnorr and A. Shamir, “An Optimal Sorting Algorithm for Mesh Connected Computers,” Proc. 18th Ann. ACM Symp. Theory of Computing, pp. 255263, 1986.
[26] C.D. Thompson and H.T. Kung, “Sorting on a Mesh Connected Parallel Computer,” Comm. ACM, vol. 20, no. 4, pp. 263271, 1977.
[27] L. Valiant and G. Brebner, “Universal Schemes for Parallel Communication,” Proc. 13th ACM Symp. Theory of Computing, pp. 263277, 1981.
[28] J.S. Vitter and D.A. Hutchinson, “Distribution Sort with Randomized Cycling,” Proc. 12th Ann. SIAM/ACM Symp. Discrete Algorithms, 2001.
[29] J.S. Vitter and E.A.M. Shriver, “Algorithms for Parallel Memory I: TwoLevel Memories,” Algorithmica, vol. 12, nos. 23, pp. 110147, 1994.