BITONIC SELECTION ALGORITHM ON SIMD MACHINES.

K. L. Chen; Shen Hong

BITONIC SELECTION ALGORITHM ON SIMD MACHINES.

K. L. Chen
, Shen Hong

University of Science and Technology of China

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Citations (Scopus)

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

Cite this

@inproceedings{4749d566a26b423693ff60605fc8e41c,

title = "BITONIC SELECTION ALGORITHM ON SIMD MACHINES.",

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.",

author = "Chen, \{K. L.\} and Shen Hong",

year = "1987",

language = "English",

isbn = "0818607807",

publisher = "IEEE",

pages = "176--182",

booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - BITONIC SELECTION ALGORITHM ON SIMD MACHINES.

AU - Chen, K. L.

AU - Hong, Shen

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0023209362

M3 - Conference contribution

AN - SCOPUS:0023209362

SN - 0818607807

SP - 176

EP - 182

BT - Unknown Host Publication Title

PB - IEEE

ER -

BITONIC SELECTION ALGORITHM ON SIMD MACHINES.

Abstract

Other files and links

Fingerprint

Cite this