Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus
Date
2002
Authors
Han, Y.
Pan, Y.
Shen, H.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
IEEE Transactions on Computers, 2002; 51(6):702-707
Statement of Responsibility
Yijie Han, Yi Pan and Hong Shen
Conference Name
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((loglogN)2/ log log log N) time. To our best knowledge, this is the best deterministic selection algorithm on any model with a reconfigurable optical bus.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright © 2002 IEEE