
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 212222, March, 2002.  
BibTex  x  
@article{ 10.1109/71.993203, author = {A. Datta and S. Soundaralakshmi and R. Owens}, title = {Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {13}, number = {3}, issn = {10459219}, year = {2002}, pages = {212222}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.993203}, 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  Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System IS  3 SN  10459219 SP212 EP222 EPD  212222 A1  A. Datta, A1  S. Soundaralakshmi, A1  R. Owens, PY  2002 KW  reconfigurable bus KW  optical bus KW  pipelined communication KW  deterministic sampling KW  merging KW  sorting algorithm VL  13 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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)worstcase time using N processors. In our second algorithm, we sort N numbers in O(\log\log N)^2) worstcase 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. 770785, 1988.
[2] D. Chiarulli, R. Melhem, and S. Levitan, "Using Coincident Optical Pulses for Parallel Memory Addressing," Computer, vol. 30, pp. 4857, 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. 269282, 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. 286293, 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. 391403, 1997. A preliminary version appeared in Proc. 11th Ann. Int'l Symp. High Performance Computing Systems, pp. 179190, July 1997.
[6] S. Levitan, D. Chiarulli, and R. Melhem, “Coincident Pulse Techniques for Multiprocessor Interconnection Structures,” Applied Optics, vol. 29, pp. 20242039, 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. 3135, 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. 911923, 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. 705720, 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. 678692, 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. 223242, 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. 237258, 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. 501513, 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. 125, 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. 11231132 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. 27, 1999.