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 language | English |
|---|---|
| Pages (from-to) | 702-707 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Computers |
| Volume | 51 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Jun 2002 |
| Externally published | Yes |
Keywords
- Analysis of algorithms
- Massive parallelism
- Optical bus
- Parallel algorithms
- Selection