STEP: A Distributed OpenMP for Coarse-Grain Parallelism Tool

Millot, Daniel; Muller, Alain; Parrot, Christian; Silber-Chaussumier, Frédérique

doi:10.1007/978-3-540-79561-2_8

Cited by 9 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PIPS has proved over the years to be a fertile ground for the polyhedral model [21], data transformations [13], communication synthesis [4,7], compilation for distributed memory machines [9,23], ILP [37], code maintenance [29,6], program verification [25], scratchpad management [8], offload compilers [14,1,10], and task parallelism [18,33].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Author retrospective for semantical interprocedural parallelization

Irigoin

Jouvelot

Triolet³

2014

25th Anniversary International Conference on Supercomputing Anniversary Volume -

View full text Add to dashboard Cite

The PIPS project was started in 1988 to investigate the automatic detection of medium-and large-grain parallelism in scientific programs thanks to summarization techniques based on convex array regions. By 1992 the PIPS system had reached its original goals, but it has morphed into a comprehensive, open-source platform still in use today. What were the key scientific and engineering decisions that made this possible in spite of some inevitable shortcomings?

show abstract

Section: Discussionmentioning

confidence: 99%

“…They support loop parallelization, with neither control nor call restrictions [13], and automatic distribution [9,23].…”

Section: Strong Pointsmentioning

confidence: 99%

Author retrospective for semantical interprocedural parallelization

Irigoin

Jouvelot

Triolet³

2014

25th Anniversary International Conference on Supercomputing Anniversary Volume -

View full text Add to dashboard Cite

show abstract

“…In [8,11,19], authors propose to extend OpenMP with additional clauses necessary for streamization as in our tool. Nevertheless, the most similar tools are proposed in [4,5] and [16]. Both, are source-to-source compilers as our tool, the first based on Cetus [7] and the second on PIPS [1] generating solutions that could be compared to ours.…”

Section: Related Workmentioning

confidence: 99%

OMP2MPI: Automatic MPI code generation from OpenMP programs

Saa-Garriga,

Castells-Rufas,

Carrabina

2015

Preprint

View full text Add to dashboard Cite

In this paper, we present OMP2MPI a tool that generates automatically MPI source code from OpenMP. With this transformation the original program can be adapted to be able to exploit a larger number of processors by surpassing the limits of the node level on large HPC clusters. The transformation can also be useful to adapt the source code to execute in distributed memory many-cores with message passing support. In addition, the resulting MPI code can be used as an starting point that still can be further optimized by software engineers. The transformation process is focused on detecting OpenMP parallel loops and distributing them in a master/worker pattern. A set of micro-benchmarks have been used to verify the correctness of the the transformation and to measure the resulting performance. Surprisingly not only the automatically generated code is correct by construction, but also it often performs faster even when executed with MPI.

show abstract

“…However, the code developed with these approaches is limited to shared memory systems. In order to overcome this limitation, several tools that execute multi-threaded applications on distributed memory architectures have been proposed but, up to now, either their implementation is based on software translations to MPI [7] or it relies on Distributed Shared Memory (DSM) systems [8]. Another option is the use of a hybrid shared/distributed memory programming model combining MPI for internode communications and resort to a shared memory model to take advantage of intra-node parallelism [9].…”

Section: Related Workmentioning

confidence: 99%

Design of Scalable Java Communication Middleware for Multi-Core Systems

Ramos

Taboada

Expósito

et al. 2012

The Computer Journal

View full text Add to dashboard Cite

This paper presents smdev, a shared memory communication middleware for multi-core systems. smdev provides a simple and powerful messaging API that is able to exploit the underlying multi-core architecture replacing inter-process and network-based communications by threads and shared memory transfers. The performance evaluation of smdev on several multi-core systems has shown noticeable improvements compared to other Java shared memory solutions, reaching and even overcoming the performance of natively compiled libraries. Thus, smdev has obtained start-up latencies around 0.76 µs and almost 90 Gbps bandwidth for point-to-point communications, as well as high performance and scalability both for collective operations and representative messaging kernels. This fact has motivated the integration of smdev in F-MPJ, our message-passing implementation in Java.

show abstract

STEP: A Distributed OpenMP for Coarse-Grain Parallelism Tool

Cited by 9 publications

References 10 publications

Author retrospective for semantical interprocedural parallelization

Author retrospective for semantical interprocedural parallelization

OMP2MPI: Automatic MPI code generation from OpenMP programs

Design of Scalable Java Communication Middleware for Multi-Core Systems

Contact Info

Product

Resources

About