Faster Sorting on a Linear Array with a Reconfigurable Pipelined Bus System

Ling Chen,Yi Pan

doi:10.1007/3-540-37619-4_22

Faster Sorting on a Linear Array with a Reconfigurable Pipelined Bus System

Ling Chen, Yi Pan

https://doi.org/10.1007/3-540-37619-4_22

Copy DOI

Publication Date: Jan 1, 2003

Affiliation: Yangzhou University, Georgia State University

#Reconfigurable Pipelined Bus System #Reconfigurable Bus System + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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 nslogn. The previous best results can sort n items in O(lognloglogn) worst-case time using n processors or sort n items in O((log logn2)worst-case time using n1+ processors. Our algorithm is also scalable to certain extent. When the system size is reduced to nslogn/r for l≤r≤logn, the total computation time is O(rlogn).

Full Text

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.