
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Mallika De, Debasish Das, Mabhin Ghosh, Bhabani P. Sinha, "An Efficient Sorting Algorithm on the MultiMesh Network," IEEE Transactions on Computers, vol. 46, no. 10, pp. 11321137, October, 1997.  
BibTex  x  
@article{ 10.1109/12.628397, author = {Mallika De and Debasish Das and Mabhin Ghosh and Bhabani P. Sinha}, title = {An Efficient Sorting Algorithm on the MultiMesh Network}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {10}, issn = {00189340}, year = {1997}, pages = {11321137}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.628397}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Efficient Sorting Algorithm on the MultiMesh Network IS  10 SN  00189340 SP1132 EP1137 EPD  11321137 A1  Mallika De, A1  Debasish Das, A1  Mabhin Ghosh, A1  Bhabani P. Sinha, PY  1997 KW  2D mesh KW  Multidimensional mesh KW  wraparound connection KW  SIMD KW  MIMD KW  sorting KW  shearsort. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—The shearsort algorithm [19] on an SIMD mesh model requires
[1] R. Reischuk, "A Fast Probabilistic Parallel Sorting Algorithm," Proc. 22nd IEEE Symp. FOCS, pp. 212219, 1981.
[2] R. Cole, "Parallel Merge Sort," Proc. 27th IEEE Symp. FOCS, pp. 511516, 1986.
[3] S.G. Akl and N. Santoro,"Optimal parallel merging and sorting without memory conflict," IEEE Trans. Computers, vol. 36, no. 11, pp. 1,3671,369, 1987.
[4] M. Ajtai,J. Komlos,W.L. Steiger, and E. Szemeredi,"An O(n log n) sorting network," Proc. Ann. ACM Symp. Theory of Computing, pp. 19, 1983.
[5] T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. Computers, vol. 34, no. 4, pp. 344354, Apr. 1985.
[6] K. Batcher, "Sorting Networks and Their Applications," Proc. AFIPS Spring Joint Computing Conf., vol. 32, pp. 307314, 1968.
[7] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[8] F. Preparata, "New Parallel Sorting Schemes," IEEE Trans. Computers, vol. 27, no. 7, pp. 669673, July 1978.
[9] D. Nassimi and S. Sahni, “Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network,” J. ACM, vol. 29, no. 3, pp. 642667, July 1982.
[10] A. Aggarwal and M.D.A. Huang, "Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks," Proc. Third Aegean Workshop Computing, AWOC '88: VLSI Algorithms and Architectures, J.H. Reif, ed., Lecture Notes in Computer Science, vol. 319, pp. 339350,Corfu, Greece. SpringerVerlag, July 1988.
[11] R. Cypher and J.L.C. Sanz, "Optimal Sorting on Reduced Architectures," Proc. ICPP, vol. 3, pp. 308311, Pennsylvania State Univ., Aug. 1988.
[12] G. Plaxton, "On the Network Complexity of Selection," Proc. 30th Ann. Symp. FOCS, pp. 396401, Nov. 1989.
[13] R. Cypher and C.G. Plaxton,“Deterministic sorting in nearly logarithmic time on the hypercube andrelated computers,” Proc. 22nd Ann. ACM Symp. Theory of Computing, pp. 193203, 1990.
[14] J.H. Reif and L.G. Valiant, "A Logarithmic Time Sort for Linear Size Networks," J. ACM, vol. 34, pp. 6076, Jan. 1987.
[15] T. Leighton, B. Maggs, A. Ranade, and S. Rao, "Randomized Routing and Sorting in FixedConnection Networks," J. Algorithms, vol. 17, no. 1, pp. 157205, 1994.
[16] T. Leighton and G. Plaxton, "A (Fairly) Simple Circuit that (Usually) Sorts," Proc. 31st Ann. Symp. FOCS, pp. 264274, Oct. 1990.
[17] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.
[18] C. Schnorr and A. Shamir,“An optimal sorting algorithm for mesh connected computers,”inProc. 18th ACM Symp. on Theory of Comput., 1986, pp. 263–271.
[19] I.D. Scherson and S. Sen, "Parallel Sorting in TwoDimensional VLSI Models of Computation," IEEE Trans. Computers, vol. 38, no. 2, pp. 238249, Feb. 1989.
[20] M. Kunde, "Optimal Sorting on Multidimensionally MeshConnected Arrays," Proc. Fourth Ann. STACS '87, Lecture Notes in Computer Science, vol. 247, pp. 408419, 1987.
[21] M. Kunde,"Routing and Sorting on MeshConnected Arrays," Proc. VLSI Algorithms and Architectures (AWOC'88), J. Reif, ed., Lecture Notes in Computer Science 319, pp. 423433, 1988.
[22] P.F. Corbett and I.D. Scherson, "Sorting in Mesh Connected Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 626632, Sept. 1992.
[23] D. Das and B.P. Sinha, "MultiMesh—An Efficient Topology for Parallel Processing," Proc. Ninth Int'l Parallel Processing Symp., pp. 1721,Santa Barbara, Calif., Apr.2528, 1995.
[24] D. Das, M. De, and B.P. Sinha, "A New Network Topology with Multiple Meshes," submitted to IEEE Trans. Computers.
[25] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. AddisonWesley, 1973.