摘要
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.
| 原文 | English |
|---|---|
| 頁(從 - 到) | 702-707 |
| 頁數 | 6 |
| 期刊 | IEEE Transactions on Computers |
| 卷 | 51 |
| 發行號 | 6 |
| DOIs | |
| 出版狀態 | Published - 6月 2002 |
| 對外發佈 | 是 |
指紋
深入研究「Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver