Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 176-182 |
| Number of pages | 7 |
| ISBN (Print) | 0818607807 |
| Publication status | Published - 1987 |
| Externally published | Yes |