Issue No. 03 - March (2002 vol. 13)

ISSN: 1045-9219

pp: 212-222

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.993203

ABSTRACT

<p>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.</p>

INDEX TERMS

reconfigurable bus, optical bus, pipelined communication, deterministic sampling, merging, sorting algorithm

CITATION

R. Owens, S. Soundaralakshmi, A. Datta, "Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 13, no. , pp. 212-222, March 2002, doi:10.1109/71.993203