This Article 
 Bibliographic References 
 Add to: 
Designing Efficient Parallel Algorithms on CRAP
May 1995 (vol. 6 no. 5)
pp. 554-560

Abstract—A cross-bridge reconfigurable array of processors is a parallel processing system which has the ability to change dynamically the supported interconnection scheme during the execution of an algorithm. Based on this architecture, several $O(1)$ time basic operations such as the transpose, the untranspose, the shift, the unshift and the prefix sum of a binary sequence are first proposed. Then, these basic operations can be used to find the $k$th smallest element of $N$$m$ bits unsigned integers in $O(m)$ time using $N$ processors and to sort $N$ data items in $O(1)$ time using $O(N^{{5}\over{3}})$ processors instead of using $O(N^2)$ processors as those proposed by other researchers [2], [4], [8], [12], [17], respectively.

Index Terms—Prefix sum, selection, sort, parallel algorithms, cross-bridge, reconfigurable bus, reconfigurable array of processors.

[1] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[2] Y. Ben-Asher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139-153, Oct. 1991.
[3] H. Elgindy and P Wegrowicz,“Selection on the reconfigurable mesh,”inProc. Int. Conf. Parallel Process., 1991, pp. III-26–III-33,
[4] J. Jang and V. K. Prasanna,“An optimal sorting algorithm on reconfigurable mesh,”inProc. Int. Parallel Process. Symp., 1992, pp. 130–137.
[5] T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. Computers, vol. 34, no. 4, pp. 344-354, Apr. 1985.
[6] H. Li and M. Maresca,“Polymorphic-torus network,”IEEE Trans. Comput., vol. 38, pp. 1345–1351, Sept. 1989.
[7] ——,“Polymorphic-torus architecture for computer vision,”IEEE Trans. Pattern Anal. and Machine Intell., vol. 11, pp. 233–243, Mar. 1989.
[8] R. Lin, S. Olariu, J. L. Schwing, and J. Zhang,“Sorting in$O(1)$time on an$n \times n$reconfigurable mesh,”inProc. 9th Europ. Workshop Parallel Comput., Madrid, Spain, Mar. 1992, pp. 16–27.
[9] M. Maresca and H. Li,“Connection autonomy in SIMD computers: a VLSI implementation,”J. Parallel Distribut. Comput., vol. 7, pp. 302–320, 1989.
[10] R. Miller,V.K. Prasanna Kumar,D.I. Reisis,, and Q.F. Stout,“Meshes with reconfigurable buses,” MIT Conf. on Advanced Research in VLSI, pp. 163-178, 1988.
[11] ——,“Data movement operations and applications on reconfigurable VLSI arrays,”inProc. Int. Conf. Parallel Process., vol. 1, Aug. 1988, pp. 205–208.
[12] K. Nakano, D. Peleg, and A. Schuster,“Constant time sorting on a reconfigurable mesh,”submitted toParallel Process. Lett.
[13] S. Olariu, J. L. Schwing, and J. Zhang,“Fundamental data movement algorithms for reconfigurable mesh,”inProc. 11th Annu. Int. Phoenix Conf. Comput. Commun., Scottsdale, AZ, Apr. 1992, pp. 480–484.
[14] J. Rothstein,“On the ultimate limitations of parallel processing,”inProc. Int. Conf. Parallel Process., 1976, pp. 206–212.
[15] ——,“Bus automata, brains, and mental models,”IEEE Trans. Syst., Man, and Cybernet., vol. 18, pp. 522–531, Apr. 1988.
[16] D. B. Shu and J. G. Nash,“The gated interconnection network for dynamic programming,”Concurrent Computing, S. K. Tewsburget al., Eds. New York: Plenum, 1988.
[17] B.F. Wang,G.H. Chen,, and F.C. Lin,“Constant time sorting on a processor array with a reconfigurable bus systems,” Information Processing Letters, vol. 34, pp. 187-192, 1990.
[18] B. F. Wang, G. H. Chen, and H. Li,“Configurational computation: a new computation method on processor arrays with reconfigurable bus system,”in1991 Int. Conf. Parallel Process., Aug. 1991, pp. III-42–III-49.

Tzong-Wann Kao, Shi-Jinn Horng, Yue-Li Wang, Horng-Ren Tsai, "Designing Efficient Parallel Algorithms on CRAP," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 5, pp. 554-560, May 1995, doi:10.1109/71.382325
Usage of this product signifies your acceptance of the Terms of Use.