Running OpenMP applications efficiently on an everything-shared SDSM

Costa, Juan José; Cortes, Toni; Martorell, Xavier; Ayguadé, Eduard; Labarta, Jesús

doi:10.1016/j.jpdc.2005.06.018

Cited by 23 publications

(16 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Costa et al [10] presented 'presend' technique similar to our technique. 'presend' analyzes access patterns and prefetches necessary pages for the next parallel loop as soon as the current parallel loop ends.…”

Section: Resultsmentioning

confidence: 87%

“…Specifically, their solution techniques can be categorized into five: implementing synchronization directives efficiently [5], reducing the shared address space [6] [8], lessening the number of page migrations [4][5] [6][8] [9][10], reducing the page migration delay with fast communication HW and page update protocol [7], and hiding the page migration overhead by overlapping computation time and page migration overhead [6] [10]. Some of these techniques are complementary, and consequently can be applied independently to improve performance.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improving Performance of OpenMP for SMP Clusters Through Overlapped Page Migrations

Jeun

Kee

2008

OpenMP Shared Memory Parallel Programming

View full text Add to dashboard Cite

Abstract.Costly page migration is a major obstacle to integrating OpenMP and page-based software distributed shared memory (SDSM) to realize the easy-touse programming paradigm for SMP clusters. To reduce the impact of the page migration overhead on the execution time of an application, the previous researches have mainly focused on reducing the number of page migrations and hiding the page migration overhead by overlapping computation and communication. We propose the 'collective-prefetch' technique, which overlaps page migrations themselves even when the prior approach cannot be effectively applied. Experiments with a communication-intensive application show that our technique reduces the page migration overhead significantly, and the overall execution time was reduced to 57%~79%.

show abstract

Section: Resultsmentioning

confidence: 87%

Section: Introductionmentioning

confidence: 99%

Improving Performance of OpenMP for SMP Clusters Through Overlapped Page Migrations

Jeun

Kee

2008

OpenMP Shared Memory Parallel Programming

View full text Add to dashboard Cite

show abstract

“…The most significant ones are the OpenMP translator developed by Hu et al [13] on top of Treadmarks [17], OpenMP on the SCASH system [11], and ParADE [16]. There is also NanosDSM [9] which uses sequential-semantic memory consistency.…”

Section: Related Workmentioning

confidence: 99%

Scalable RDMA performance in PGAS languages

Farreras

Almási

Caşcaval

et al. 2009

2009 IEEE International Symposium on Parallel &Amp; Distributed Processing

Self Cite

View full text Add to dashboard Cite

Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, or cluster of SMPs. 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.

show abstract

“…Concerning the execution of OpenMP applications on top of software DSMs Costa et al have also proposed to encourage cooperation between the SDSM and the OpenMP runtime [4], instead of relaxing the consistency semantics [10].…”

Section: Related Workmentioning

confidence: 99%

A Case for Dynamic Page Migration in Multiple-Writer Software DSM Systems

Repantis

Antonopoulos

Kalogeraki

et al. 2005

2005 IEEE International Conference on Cluster Computing

View full text Add to dashboard Cite

Software DSMs (SDSMs) are an appealing alternative to message passing, since they facilitate the programmability of clusters. However the ease of programming comes at the expense of performance. Although accesses of data that reside to the memory of remote nodes are transparent to the programmer, they suffer from significantly higher latencies compared to local accesses. As a consequence, it is desirable to move data as close as possible to the nodes that need them most.In this paper we introduce a protocol for dynamically migrating memory pages in home-based SDSM systems. In these systems each page has a designated home node; yet our protocol allows a node that heavily modifies a page to become its new home. The new protocol targets multiplewriter DSMs, i.e. DSMs that allow multiple nodes to concurrently modify the same page. The process is dynamic and transparent to the applications programmer. Moreover, it does not assume a specific consistency protocol.Experimental results show that our page migration protocol reduces remote page modifications, decreases the average memory access latency, as well as the overhead for the preservation of memory consistency. The benefit for the end-user is a significant improvement in application performance.

show abstract

Running OpenMP applications efficiently on an everything-shared SDSM

Cited by 23 publications

References 18 publications

Improving Performance of OpenMP for SMP Clusters Through Overlapped Page Migrations

Improving Performance of OpenMP for SMP Clusters Through Overlapped Page Migrations

Scalable RDMA performance in PGAS languages

A Case for Dynamic Page Migration in Multiple-Writer Software DSM Systems

Contact Info

Product

Resources

About