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 |
|---|---|
| Pages | 154-159 |
| Number of pages | 6 |
| Publication status | Published - 1997 |
| 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 |
ASJC Scopus subject areas
- Hardware and Architecture