Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus

Yijie Han, Yi Pan, Hong Shen

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

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

Original languageEnglish
Pages (from-to)702-707
Number of pages6
JournalIEEE Transactions on Computers
Volume51
Issue number6
DOIs
Publication statusPublished - Jun 2002
Externally publishedYes

Keywords

  • Analysis of algorithms
  • Massive parallelism
  • Optical bus
  • Parallel algorithms
  • Selection

Fingerprint

Dive into the research topics of 'Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus'. Together they form a unique fingerprint.

Cite this