Abstract
We present a fast algorithm for sorting on a linear array with a reconfigurable pipelined bus system (LARPBS), one of the recently proposed parallel architectures based on optical buses. Our algorithm sorts N numbers in O(log N log logN) worst-case time using N processors. To our knowledge, the previous best sorting algorithm on this architecture has a running time of O(log2N).
This research is partially supported by an Australian Research Council (ARC) grant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Z. Guo, R. Melhem, R. Hall, D. Chiarulli, S. Levitan, “Pipelined communication in optically interconnected arrays”, Journal of Parallel and Distributed Computing, 12,(3), (1991), pp. 269–282.
K. Li, Y. Pan and S. Q. Zheng, “Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system”, IEEE Trans. Parallel and Distributed Systems, 9,(8), (1998), pp. 705–720.
R. Miller, V. K. Prasanna Kumar, D. Reisis and Q. F. Stout, Parallel computations on reconfigurable meshes. IEEE Trans. Computers, 42, (1993), 678–692.
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, 1998.
Y. Pan and K. Li, “Linear array with a reconfigurable pipelined bus system-concepts and applications”, Journal of Information Sciences, 106, (1998), pp. 237–258.
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, 13, (1997/98), pp. 501–513.
Y. Pan, K. Li and S. Q. Zheng, “Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system”, Journal of Parallel Algorithms and Applications, 13, (1998), pp. 1–25.
S. Sahni, “Models and algorithms for optical and optoelectronic parallel computers”, Proc. 1999 International Symposium on Parallel Architectures, Algorithms and Networks, IEEE Computer Society, pp. 2–7.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A., Owens, R., Soundaralakshmi, S. (2000). Fast Sorting on a Linear Array with a Reconfigurable Pipelined Bus System. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_151
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive