Scalable RDMA performance in PGAS languages

View/Open
Document typeConference report
Defense date2009-05
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
Partitioned global address space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, or cluster ofSMPs. Users can program large scale machines with easy-to-use, shared memory paradigms. In order to exploit large scale machines efficiently, PGAS language implementations and their runtime system must be designed for scalability and performance. The IBM XLUPC compiler and runtime system provide a scalable design through the use of the shared variable directory (SVD). The SVD stores meta-information needed to access shared data. It is dereferenced, in the worst case, for every shared memory access, thus exposing a potential performance problem. In this paper we present a cache of remote addresses as an optimization that will reduce the SVD access overhead and allow the exploitation of native (remote) direct memory accesses. It results in a significant performance improvement while maintaining the run-time portability and scalability.
CitationFarreras, M.; Almási, G.; Cortés, T. Scalable RDMA performance in PGAS languages. A: 23rd IEE International Parallel & Distributed Processing Symposium. "23rd IEE International Parallel & Distributed Processing Symposium". Roma: 2009, p. 1-12.
Publisher versionhttp://doi.ieeecomputersociety.org/10.1109/IPDPS.2009.5161025
Files | Description | Size | Format | View |
---|---|---|---|---|
Scalable.pdf | 398,3Kb | View/Open |