The Community for Technology Leaders
Green Image
Issue No. 06 - June (1994 vol. 43)
ISSN: 0018-9340
pp: 749-751
<p>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.</p>
sorting; parallel algorithms; reconfigurable architectures; multiprocessor interconnection networks; computational complexity; constant time sorting; reconfigurable meshes; reconfigurable bus; parallel algorithms.

W. Chen and C. Chen, "Constant Time Sorting on Reconfigurable Meshes," in IEEE Transactions on Computers, vol. 43, no. , pp. 749-751, 1994.
83 ms
(Ver 3.3 (11022016))