The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Publications of SPCL
|Remote Memory Access Programming: Faster Parallel Computing Without Messages|
(Presentation - presented in Atlanta, GA, USA, Jun. 2015, )
AbstractRemote memory access (RMA) or partitioned global address space programming offers abstractions to coordinate directly accessible distributed memory domains. The presentation will start with an analysis of established technologies (cache-coherence), continue to describe RMA programming abstractions and example codes, and conclude with proposals for the future of RMA. In the first part, we will use an intuitive performance model to briefly demonstrate the complexities of cache-coherent systems with regards to performance tuning. We will exemplify these findings with results on Intel's Xeon Phi and Sandy Bridge CPUs where we speed up communication algorithms by up to 4.3x. We continue by showing how RMA programming simplifies the design and tuning and introduce MPI-3's RMA semantics as a particuler example. We discuss our reference implementation for Cray machines foMPI and demonstrate results with up to half a million processes. We conclude the talk by addressing producer-consumer synchronizations in task-based runtime environments and the new proposal of notified access. Overall, we advocate RMA as a potential programming model for scalable systems ranging from single-die multicores to large-scale supercomputers.