Issue No. 06 - June (2002 vol. 51)
<p><b>Abstract</b>—The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model, where processors are connected by a reconfigurable optical bus. In this paper, we show that the selection problem can be solved on the LARPBS model deterministically in <tmath>\big. O((\log \log N)^2 / \log \log \log N )\bigr.</tmath> time. To our best knowledge, this is the best deterministic selection algorithm on any model with a reconfigurable optical bus.</p>
Analysis of algorithms, massive parallelism, optical bus, parallel algorithms, selection.
Y. Han, Y. Pan and H. Shen, "Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus," in IEEE Transactions on Computers, vol. 51, no. , pp. 702-707, 2002.