摘要
The performance of the bitonic selection algorithm on three typical single instruction, multiple data machine models, namely, the cube-connected, shuffle-exchange-connected, and mesh-connected computers with n, n/2, and ROOT n multiplied by ROOT n processors, respectively, is investigated. The numbers of data compare--exchanges and the number of data transfers are compared for the three models.
| 原文 | English |
|---|---|
| 主出版物標題 | Unknown Host Publication Title |
| 發行者 | IEEE |
| 頁面 | 176-182 |
| 頁數 | 7 |
| ISBN（列印） | 0818607807 |
| 出版狀態 | Published - 1987 |
| 對外發佈 | 是 |