Abstract
The performance portability of parallel programs across a wide range of emerging coherent shared address space systems is not well understood. Programs that run well on efficient, hardware cache-coherent systems often do not perform well on less optimal or more commodity-based communication architectures. This paper studies this issue of performance portability, with the commodity communication architecture of interest being page-grained shared virtual memory. We begin with applications that perform well on moderate-scale hardware cache-coherent systems, and find that they do not do so well on SVM systems. Then, we examine whether and how the applications can be improved for SVM systems - through data structuring or algorithmic enhancements - and the nature and difficulty of the optimizations. Finally, we examine the impact of the successful optimizations on hardware-coherent platforms themselves, to see whether they are helpful, harmful or neutral on those platforms. We develop a systematic methodology to explore optimizations in different structured classes. The results, and the difficulty of the optimizations, lead insight not only into performance portability but also into the viability of SVM as a platform for these types of applications.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP |
Editors | Anon |
Publisher | ACM |
Pages | 217-229 |
Number of pages | 13 |
State | Published - Jan 1 1997 |
Event | Proceedings of the 1997 6th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - Las Vegas, NV, USA Duration: Jun 18 1997 → Jun 21 1997 |
Other
Other | Proceedings of the 1997 6th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming |
---|---|
City | Las Vegas, NV, USA |
Period | 6/18/97 → 6/21/97 |
All Science Journal Classification (ASJC) codes
- Software