This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
March 2002 (vol. 13 no. 3)
pp. 212-222

We present two fast algorithms for sorting on a linear array with a reconfigurable pipelined bus system (LARPBS), one of the recently proposed parallel architectures based on optical buses. In our first algorithm, we sort N numbers in O(\log N\log\log N)worst-case time using N processors. In our second algorithm, we sort N numbers in O(\log\log N)^2) worst-case time using N^{1+\epsilon} processors, for any fixed \epsilon such that 0\epsilon1. Our algorithms are based on a novel deterministic sampling scheme for merging two sorted arrays of length N each in O(\log\log N) time on an LARPBS with N processors. To our knowledge, the previous best sorting algorithm on this architecture has a running time of O(\log N)^{2}) using N processors.

[1] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770-785, 1988.
[2] D. Chiarulli, R. Melhem, and S. Levitan, "Using Coincident Optical Pulses for Parallel Memory Addressing," Computer, vol. 30, pp. 48-57, 1987.
[3] Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan, “Pipelined Communication in Optically Interconnected Arrays,” J. Parallel and Distributed Computing, vol. 12, no. 3, pp. 269-282, 1991.
[4] Y. Han, Y. Pan, and H. Shen, “Fast Parallel Selection on the Linear Array with Reconfigurable Bus System,” Proc. Seventh Symp. Frontiers of Massively Parallel Computation, pp. 286-293, 1999.
[5] K. Li, "Constant Time Boolean Matrix Multiplication on a Linear Array With a Reconfigurable Pipelined Bus System," J. Supercomputing, vol. 11, no. 4, pp. 391-403, 1997. A preliminary version appeared in Proc. 11th Ann. Int'l Symp. High Performance Computing Systems, pp. 179-190, July 1997.
[6] S. Levitan, D. Chiarulli, and R. Melhem, “Coincident Pulse Techniques for Multiprocessor Interconnection Structures,” Applied Optics, vol. 29, pp. 2024-2039, 1990.
[7] K. Li and V.Y. Pan, “Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System,” Proc. 13th Int'l Parallel Processing Symp. and 10th Symp. Parallel and Distributed Processing, pp. 31-35, 1999.
[8] K. Li, Y. Pan, and M. Hamdi, “Solving Graph Theory Problems Using Reconfigurable Pipelined Optical Buses,” Proc. Third Workshop Optics and Computer Science, (WOCS '99), vol. 1586, pp. 911-923, 1999.
[9] K. Li, Y. Pan, and S.-Q. Zheng, “Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array with Reconfigurable Pipelined Bus System,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 8, pp. 705-720, Aug. 1998.
[10] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678-692, June 1993.
[11] Y. Pan, “Basic Data Movement Operations on the LARPBS Model,” Parallel Computing Using Optical Interconnections, K. Li, Y. Pan, and S.Q. Zheng, eds., Kluwer Academic Publishers, Boston, 1998.
[12] S. Pavel and S. Akl, “Matrix Operations Using Arrays with Reconfigurable Optical Buses,” Parallel Algorithms and Applications, vol. 11, pp. 223-242, 1996.
[13] Y. Pan and K. Li, “Linear Array with a Reconfigurable Pipelined Bus System—Concepts and Applications,” Information Sciences, vol. 106, no. 3/4, pp. 237-258, May 1998.
[14] Y. Pan, M. Hamdi, and K. Li, “Efficient and Scalable Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System,” Future Generation Computer Systems, vol. 13, pp. 501-513, 1997/98.
[15] Y. Pan, K. Li, and S.Q. Zheng, “Fast Nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System,” J. Parallel Algorithms and Applications, vol. 13, pp. 1-25, 1998.
[16] S. Rajasekaran and S. Sahni, “Sorting, Selection and Routing on the Arrays with Reconfigurable Optical Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 1123-1132 Nov. 1997.
[17] S. Sahni, “Models and Algorithms for Optical and Optoelectronic Parallel Computers,” Proc. Fourth IEEE Int'l Symp. Parallel Architectures, Algorithms, and Networks, pp. 2-7, 1999.

Index Terms:
reconfigurable bus, optical bus, pipelined communication, deterministic sampling, merging, sorting algorithm
Citation:
A. Datta, S. Soundaralakshmi, R. Owens, "Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 212-222, March 2002, doi:10.1109/71.993203
Usage of this product signifies your acceptance of the Terms of Use.