Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus

  • Authors:
  • Yijie Han;Yi Pan;Hong Shen

  • Affiliations:
  • -;-;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 2002

Quantified Score

Hi-index 14.98

Visualization

Abstract

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 \big. O((\log \log N)^2 / \log \log \log N )\bigr. time. To our best knowledge, this is the best deterministic selection algorithm on any model with a reconfigurable optical bus.