
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P.F. Corbett, I.D. Scherson, "Sorting in Mesh Connected Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 5, pp. 626632, September, 1992.  
BibTex  x  
@article{ 10.1109/71.159046, author = {P.F. Corbett and I.D. Scherson}, title = {Sorting in Mesh Connected Multiprocessors}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {3}, number = {5}, issn = {10459219}, year = {1992}, pages = {626632}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.159046}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Sorting in Mesh Connected Multiprocessors IS  5 SN  10459219 SP626 EP632 EPD  626632 A1  P.F. Corbett, A1  I.D. Scherson, PY  1992 KW  Index Termssorting algorithm; MeshSort; multidimensional meshconnected multiprocessors; Bitonic Sort; ShearSort; parallel sorting; orthogonal vectors; reduced architecture; multidimensional memory structure; FastMeshSort; routing algorithm; multiprocessor interconnection networks; parallel algorithms; sorting VL  3 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S. G. Akl,Parallel Sorting Algorithms. Orlando, FL: Academic, 1985.
[2] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS Conf. Proc., 1968 Spring Joint Comput. Conf., 1968, pp. 307314.
[3] G. Baudet and D. Stevenson, "Optimal sorting algorithms for parallel computers,"IEEE Trans. Comput., vol. C27, no. 1, pp. 8487, Jan. 1978.
[4] R. Cypher and C. G. Plaxton, "Deterministic sorting in nearly logarithmic time on the hypercube and related computers," inProc. 22nd ACM Symp. Theory Comput., 1990, pp. 193203.
[5] R. Cypher and J. L. C. Sanz, "Optimal sorting on reduced architectures," inProc. Int. Conf. Parallel Processing, vol. 3, St. Charles, IL, Aug. 1988, pp. 308311.
[6] Y. Han and Y. Igarashi, "Time lower bounds for sorting on multidimensional meshconnected processor arrays," inProc. Int. Conf. Parallel Processing, vol. 3, St. Charles, IL, Aug. 1988, pp. 194197.
[7] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: AddisonWesley, 1973.
[8] M. Kunde, "Lower bounds for sorting on meshconnected architectures," inProc. VLSI Algorithms and Architectures: Aegean Workshop Comput., June 1986, pp. 8495.
[9] M. Kunde, "Optimal sorting on multidimensionally meshconnected computers," inProc. Symp. Theoret. Aspects Comput. Sci., Feb. 1987, pp. 408419.
[10] T. Leighton, "Tight bounds on the complexity of parallel sorting,"IEEE Trans. Comput., vol. C34, no. 4, pp. 344354, Apr. 1985.
[11] J. M. Marberg and E. Gafni, "Sorting in constant number of row and column phases on a mesh," inProc. 24th Annu. Allerton Conf. Commun., Contr., Comput., Oct. 1986, pp. 603612.
[12] D. Nassimi and S. Sahni, "Bitonic sort on a meshconnected parallel computer,"IEEE Trans. Comput., vol. C27, no. 1, pp. 27, Jan. 1979.
[13] G. Plaxton, "Load balancing, selection and sorting on the hypercube," inProc. 1st ACM Symp. Parallel Algorithms and Architectures, June 1989, pp. 6473.
[14] L. Rudolph, "A robust sorting network,"IEEE Trans. Comput., vol. C34, no. 4, pp. 326335, Apr. 1985.
[15] K. Sado and Y. Igarashi, "Some parallel sorts on a meshconnected processor array and their time efficiency,"J. Parallel Distributed Comput., vol. 3, pp. 398410, Sept. 1986.
[16] I. D. Scherson, "Orthogonal graphs for the construction of a class of interconnection networks,"IEEE Trans. Parallel Distributed Syst., vol. 2, no. 1, pp. 319, Jan. 1991.
[17] I. D. Scherson and Y. Ma, "Analysis and applications of an orthogonal access multiprocessor,"J. Parallel Distributed Comput., vol. 7, pp. 232255, 1989.
[18] I. D. Scherson and S. Sen, "Parallel sorting in twodimensional VLSI models of computation,"IEEE Trans. Comput., vol. 38, no. 2, pp. 238249, Feb. 1989.
[19] I. D. Scherson, S. Sen, and A. Shamir, "Shearsort: A true twodimensional sorting technique for VLSI networks," inProc. Int. Conf. Parallel Processing, 1986.
[20] C. P. Schnorr and A. Shamir, "An optimal sorting algorithm for mesh connected computers," inProc. 18th ACM Symp. Theory Comput., May 1986.
[21] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, no. 2, pp. 153161, Feb. 1971.
[22] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263271, 1972.