The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In this paper, we present efficient algorithms for sorting, selection, and packet routing on the AROB (Array with Reconfigurable Optical Buses) model. One of our sorting algorithms sorts <it>n</it> general keys in <it>O</it>(1) time on an AROB of size <tmath>$n^\epsilon \times n$</tmath> for any constant <tmath>$\epsilon > 0.$</tmath> We also show that selection from out of <it>n</it> elements can be done in randomized <it>O</it>(1) time employing <it>n</it> processors. Our routing algorithm can route any <it>h</it>-relation in randomized <it>O</it>(<it>h</it>) time. All these algorithms are clearly optimal.</p>
Reconfigurable networks, optical computing, mesh-connected computers, comparison problems, interprocessor communication, sorting.
Sanguthevar Rajasekaran, Sartaj Sahni, "Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses", IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 1123-1132, November 1997, doi:10.1109/71.642947
614 ms
(Ver 3.3 (11022016))