This Article 
 Bibliographic References 
 Add to: 
Constant Time Sorting on Reconfigurable Meshes
June 1994 (vol. 43 no. 6)
pp. 749-751

We present a constant time sorting algorithm by adopting a 3D reconfigurable mesh with only O(n/sup 3/2/) processors. Our algorithm is developed on an n/sup 1/2//spl times/n/sup 1/2//spl times/n/sup 1/2/ 3-D reconfigurable mesh. Moreover, we further extend the result to k-dimensional reconfigurable meshes for k/spl ges/3. Consequently, an O(4/sup k+1/) time sorting algorithm is obtained by adopting an n/sup 1/(k-1)//spl times/n/sup 1/(k-1)//spl times/.../spl times/n/sup 1/(k-1)/k-D reconfigurable mesh of size O(n/sup 1+1/(k-1)/). Hence, constant time sorting using O(n/sup 1+/spl epsiv//) processors, where O>/spl epsiv//spl Lt/1, can be realized by adopting reconfigurable meshes of high dimensions.

[1] Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, "The power of reconfiguration,"J. Parallel Distributed Computing, pp. 139-153, 1991.
[2] J. W. Jang and V. K. Prasanna, "An optimal sorting algorithm on reconfigurable mesh," Inst. for Robotics and Intelligent Syst., Univ. of Southern California, Los Angeles, CA, Tech. Rep. IRIS #277, 1991.
[3] T. Leighton, "Tight bounds on the complexity of parallel sorting,"IEEE Trans. Comput., vol. C-34, no. 4, pp. 344-354, Apr. 1985.
[4] H. Li, "Reconfigurable SIMD parallel processors," 1990, submitted for publication.
[5] H. Li and M. Maresca, "Polymorphic-torus architecture for computer vision,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 3, pp. 233-243, 1989.
[6] M. Maresca and H. Li, "Connection autonomy in SIMD computers: A VLSI implementation,"J. Parallel Distrib. Computing, vol. 7, pp. 302-320, 1989.
[7] R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. Stout, "Meshes with reconfigurable buses," inProc. 5th MIT Conf. Advanced Res. VLSI(Cambridge, MA), 1988, pp. 163-178.
[8] R. Miller, V. K. Prasanna Kumar, D. I. Reisis, and Q. F. Stout, "Data movement operations and applications on reconfigurable VLSI arrays," inProc. Int. Conf. Parallel Processing, vol. 1, 1988, pp. 205-208.
[9] K. Nakana, T. Masuzawa, and N. Tokura, "A fast sorting algorithm on a reconfigurable array," Tech. Rep. COMP 90-69, Inst. of Electron., Inform., and Commun. Eng., Osaka Univ., Toyonaka-shi, Osaka, Japan, Dec. 1990.
[10] B. F. Wang and G. H. Chen, "Two-dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model,"Inform. Processing Lett., vol. 36, pp. 31-36, 1990.
[11] B. F. Wang and G. H. Chen, "Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems,"IEEE Trans. Parallel Distrib. Syst., vol. 1, no. 4, Oct. 1990.
[12] B. F. Wang, G. H. Chen, and F. C. Lin, "Constant time sorting on a processor array with a reconfigurable bus systems,"Info. Processing Letts., pp. 187-192, 1990.

Index Terms:
sorting; parallel algorithms; reconfigurable architectures; multiprocessor interconnection networks; computational complexity; constant time sorting; reconfigurable meshes; reconfigurable bus; parallel algorithms.
C.-C. Chen, W.-T. Chen, "Constant Time Sorting on Reconfigurable Meshes," IEEE Transactions on Computers, vol. 43, no. 6, pp. 749-751, June 1994, doi:10.1109/12.286307
Usage of this product signifies your acceptance of the Terms of Use.