OpenMP provides several mechanisms to specify parallel source-code transformations. Unfortunately, many compilers perform these transformations early in the translation process, often before performing traditional sequential optimizations, which can limit the effectiveness of those optimizations. Further, OpenMP semantics preclude performing those transformations in some cases prior to the parallel transformations, which can limit overall application performance. In this paper, we propose extensions to OpenMP that require the application of traditional sequential loop optimizations. These extensions can be specified to apply before, as well as after, other OpenMP loop transformations. We discuss limitations implied by existing OpenMP const...
The wide adoption of parallel processing hardware in mainstream computing as well as the raising int...
We present our effort to provide a comprehensive parallel programming environment for the OpenMP par...
Parallel reduction algorithms are frequent in high performance computing areas, thus, modern paralle...
OpenMP provides several mechanisms to specify parallel source-code transformations. Unfortunately, m...
We have developed compiler optimization techniques for explicit parallel programs using the OpenMP A...
International audienceThis paper presents a technique for representing the high level semantics of p...
This paper presents a simple method to reduce performance loss due to a parallel program's massive c...
In this paper we will make an experimental description of the parallel programming using OpenMP. Usi...
In recent years parallel computing has become ubiquitous. Lead by the spread of commodity multicore ...
The performance of many parallel applications relies not on instruction-level parallelism but on loo...
Abstract. OpenMP has gained wide popularity as an API for parallel programming on shared memory and ...
In this paper, we present the compiler transformation of OpenMP code to an ordered collection of tas...
Developing efficient programs for many of the current parallel computers is not easy due to the arch...
Multi-core architectures have become more popular due to better performance, reduced heat dissipatio...
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming ...
The wide adoption of parallel processing hardware in mainstream computing as well as the raising int...
We present our effort to provide a comprehensive parallel programming environment for the OpenMP par...
Parallel reduction algorithms are frequent in high performance computing areas, thus, modern paralle...
OpenMP provides several mechanisms to specify parallel source-code transformations. Unfortunately, m...
We have developed compiler optimization techniques for explicit parallel programs using the OpenMP A...
International audienceThis paper presents a technique for representing the high level semantics of p...
This paper presents a simple method to reduce performance loss due to a parallel program's massive c...
In this paper we will make an experimental description of the parallel programming using OpenMP. Usi...
In recent years parallel computing has become ubiquitous. Lead by the spread of commodity multicore ...
The performance of many parallel applications relies not on instruction-level parallelism but on loo...
Abstract. OpenMP has gained wide popularity as an API for parallel programming on shared memory and ...
In this paper, we present the compiler transformation of OpenMP code to an ordered collection of tas...
Developing efficient programs for many of the current parallel computers is not easy due to the arch...
Multi-core architectures have become more popular due to better performance, reduced heat dissipatio...
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming ...
The wide adoption of parallel processing hardware in mainstream computing as well as the raising int...
We present our effort to provide a comprehensive parallel programming environment for the OpenMP par...
Parallel reduction algorithms are frequent in high performance computing areas, thus, modern paralle...