Abstract
In this paper, we present an efficient deterministic algorithm for sorting on the LARPBS (Linear Array with a Reconfigurable Pipelined Optical Bus System) model. Our sorting algorithm sorts n general keys in O(logn) time on a LARPBS of size n·logn. The previous best results can sort n items in O(lognloglogn) worst-case time using n processors or sort n items in O((log logn)2)worst-case time using n 1+ɛ processors. Our algorithm is also scalable to certain extent. When the system size is reduced to n·logn/r for l≤r≤logn, the total computation time is O(rlogn).
This research was supported in part by Chinese National Science Foundation under contract 60074013, Chinese National Foundation of High Performance Computing under contract 00219 and Science Foundation of Jiangsu Educational Commission, China.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Pan “Basic data movement operations on the LARPBS model” in Parallel Computing Using Optical Interconnections, K. Li, Y. Pan and S. Q. Zheng, eds., Kluwer Academic Publishers, Boston, USA, October 1998
S. Pavel and S. G. Akl, “Integer sorting and routing in arrays with reconfigurable optical bus,” Proc. 1996 International Conf. on Parallel Processing, Vol. III, pp. 90–94, August 1996
S. Rajasekaran and S. Sahni, “Sorting, selection and routing on the arrays with reconfigurable optical buses,” IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 11, pp. 1123–1132, Nov. 1997
C. H. Wu, S.-J. Horng, and H.-R. Tsai, “An Optimal Parallel Algorithm for Computing Moments on Arrays with Reconfigurable Optical Buses,” Proceedings of the 2000 International Parallel and Distributed Processing Symposium, May 1–5, 2000, Cancun, Mexico, pp. 741–746
Y. Pan, K. Li, and S. Q. Zheng, “Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system,” Parallel Algorithms and Applications, Vol. 13, pp. 1–25, 1998
J. L. Trahan, A. G. Bourgeois, Y. Pan, and R. Vaidyanathan, “An Optimal and Scalable Algorithm for Permutation Routing on Reconfigurable Linear Arrays with Optically Pipelined Buses,” Journal of Parallel and Distributed Computing, Vol. 60, No. 9, Sept. 2000, pp. 1125–1136
K. Li, Y. Pan, and S.-Q. Zheng, “Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems,” The Journal of Supercomputing, vol. 15, no. 2, pp. 163–181, February 2000
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, No. 6, pages 501–513, June 1998
A. G. Bourgeois and J. L. Trahan, “Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses,” Proceedings of the 2000 International Parallel and Distributed Processing Symposium, May 1–5, 2000, Cancun, Mexico, pp. 747–752
Y. Han, Y. Pan and H. Shen, “Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus,” IEEE Transactions on Computers, Vol. 51, No. 6, pp. 702–707, June 2002
A. Datta, S. Soundaralakshmi and 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
L. G. Valiant, “Parallelism in comparison problems”, SIAM J. Commput, 1975, 4(3):348–355
F. P. Preparata, “New parallel-sorting schemes”, IEEE Trans. Computers, 1978,21(8):657–661
K. Li, Y. Pan and S.Q. Zheng, “Fast processor efficient parallel matrix multiplication algorithm on a linear array with a reconfigurable pipelined bus systems”, IEEE Trans. Parallel and Distributed Sysytems, 1998 9(8): 705–720
R. Cole, “Parallel merge sort,” SIAM Journal of Computing, Vol. 14, 1988, pp. 770–785
L. G. Valiant, “Parallelism in comparison problems”, SIAM J. Commput., 1975, 4(3):348–355
F. P. Preparata, “New parallel-sorting schemes”, IEEE Trans. Computers, 1978,21(8):657–661
K. Li, Y. Pan and S.Q. Zheng, “Fast processor efficient parallel matrix multiplication algorithm on a linear array with a reconfigurable pipelined bus systems”, IEEE Trans. Parallel and Distributed Sysytems, 1998 9(8): 705–720
R. Cole, “Parallel merge sort,” SIAM Journal of Computing, Vol. 14, 1988, pp. 770–785
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Pan, Y. (2003). Faster Sorting on a Linear Array with a Reconfigurable Pipelined Bus System. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-37619-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40523-8
Online ISBN: 978-3-540-37619-4
eBook Packages: Springer Book Archive