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 log N) worst-case time using N processors. To our knowledge, the previous best sorting algorithm on this architecture has a running time of O(log2 N). © 2000 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Datta, A., Owens, R., & Soundaralakshmi, S. (2000). Fast sorting on a linear array with a reconfigurable pipelined bus system? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 1110–1117). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_151
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
