87 research outputs found
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
No full textWe present two fast algorithms for sorting on a linear array with a recongurable pipelined bus system (LARPBS), one of the recently proposed parallel architectures based on optical buses. In our rst 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+ processors, for any xed such that 0 < < 1. 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. Index Terms { recongurable bus, optical bus, pipelined communication, deterministic sampling, merging, sorting algorithm. This research is partially supported by an Australian Research Council (ARC) Grant. y Corresponding author. z Department of Computer Scien..
Author Correction: COVID-19 vaccine guidance for patients with cancer participating in oncology clinical trials
No full textIn the original version of this Perspective, the name of the author Giuseppe Curigliano was incorrectly written as Guiseppe Curigiliano. The affiliations have been corrected in the HTML and PDF versions of the manuscrip
Fast Sorting on a Linear Array with a Reconfigurable Pipelined Bus System
No full textAbstract. 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 numbers in worst-case time using processors. To our knowledge, the previous best sorting algorithm on this architecture has a running time of.
- …
