Abstract
This paper investigates the execution behaviors of parallel sorting algorithms on an experimental multiprocessor (KuPP) and compares with predicted performance under LogP and BSP (Bulk Synchronous Parallel) models. Since the communication overhead is considered a primary candidate for improvement, a few schemes are devised and experimented on KuPP to reduce the time spent in communication, thus to enhance the overall performance. The authors believe the ideas can be adopted in other high-performance parallel computers.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS |
| Editors | Anon |
| Place of Publication | Los Alamitos, CA, United States |
| Publisher | IEEE Comp Soc |
| Pages | 154-159 |
| Number of pages | 6 |
| Publication status | Published - 1997 Dec 1 |
| Event | Proceedings of the 1997 International Conference on Parallel and Distributed Systems - Seoul, South Korea Duration: 1997 Dec 10 → 1997 Dec 13 |
Other
| Other | Proceedings of the 1997 International Conference on Parallel and Distributed Systems |
|---|---|
| City | Seoul, South Korea |
| Period | 97/12/10 → 97/12/13 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
Performance analysis and experiments of sorts on a parallel computer with parallel computation models. / Kim, Dong Seung; Yoon, Ilhong.
Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. ed. / Anon. Los Alamitos, CA, United States : IEEE Comp Soc, 1997. p. 154-159.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Performance analysis and experiments of sorts on a parallel computer with parallel computation models
AU - Kim, Dong Seung
AU - Yoon, Ilhong
PY - 1997/12/1
Y1 - 1997/12/1
N2 - This paper investigates the execution behaviors of parallel sorting algorithms on an experimental multiprocessor (KuPP) and compares with predicted performance under LogP and BSP (Bulk Synchronous Parallel) models. Since the communication overhead is considered a primary candidate for improvement, a few schemes are devised and experimented on KuPP to reduce the time spent in communication, thus to enhance the overall performance. The authors believe the ideas can be adopted in other high-performance parallel computers.
AB - This paper investigates the execution behaviors of parallel sorting algorithms on an experimental multiprocessor (KuPP) and compares with predicted performance under LogP and BSP (Bulk Synchronous Parallel) models. Since the communication overhead is considered a primary candidate for improvement, a few schemes are devised and experimented on KuPP to reduce the time spent in communication, thus to enhance the overall performance. The authors believe the ideas can be adopted in other high-performance parallel computers.
UR - http://www.scopus.com/inward/record.url?scp=0031332345&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0031332345&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0031332345
SP - 154
EP - 159
BT - Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
A2 - Anon, null
PB - IEEE Comp Soc
CY - Los Alamitos, CA, United States
ER -