12 pagesInternational audienceArray remappings are useful to many applications on dis tributed memory parallel machines. They are available in High Performance Fortran a Fortran based data- parallel language . This paper describes techniques to handle dy namic mappings through simple array copies array remap pings are translated into copies between statically mapped distinct versions of the array It discusses the language re strictions required to do so. The remapping graph which captures all remapping and liveness information is pre sented as well as additional data ow optimizations that can be performed on this graph so as to avoid useless remap pings at run time . Such useless remappings appear for arrays that are not used after a remapp...
This work has been supported by the Esprit programme through the SECOND project (Esprit-BRA No. 6769...
Scientific computing and image processing applications access large amounts of data in r...
Parallel disk systems provide opportunities for exploiting I/O parallelism in two possible ways, nam...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a reb...
We consider the problem of reporting the pairwise enclosures among a set of $n$ axes-parallel rectan...
In the framework of fully permutable loops, tiling has been extensively studied as a source-to-sourc...
This thesis presents a design style for implementing communicating sequential processes (CSP) as qua...
In the data parallel programming style the user usually specifies the data parallelism explicitly so...
It is easy to find errors and inefficient parts of a sequential program, by using a standard debugge...
This paper deals with the computation of reciprocals, square roots, inverse square roots, and some e...
In this paper, an efficient algorithm to simultaneously implement array alignment and data/computati...
The purpose of this paper is to treat digit set conversions and digit recodings in terms of primitiv...
Given a set $L$ of $n$ points in the $d$-dimensional Cartesian space $E^d$, and a query specifying a...
Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs a...
The problem to represent very complex systems has been studied by several authors, obtaining ...
This work has been supported by the Esprit programme through the SECOND project (Esprit-BRA No. 6769...
Scientific computing and image processing applications access large amounts of data in r...
Parallel disk systems provide opportunities for exploiting I/O parallelism in two possible ways, nam...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a reb...
We consider the problem of reporting the pairwise enclosures among a set of $n$ axes-parallel rectan...
In the framework of fully permutable loops, tiling has been extensively studied as a source-to-sourc...
This thesis presents a design style for implementing communicating sequential processes (CSP) as qua...
In the data parallel programming style the user usually specifies the data parallelism explicitly so...
It is easy to find errors and inefficient parts of a sequential program, by using a standard debugge...
This paper deals with the computation of reciprocals, square roots, inverse square roots, and some e...
In this paper, an efficient algorithm to simultaneously implement array alignment and data/computati...
The purpose of this paper is to treat digit set conversions and digit recodings in terms of primitiv...
Given a set $L$ of $n$ points in the $d$-dimensional Cartesian space $E^d$, and a query specifying a...
Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs a...
The problem to represent very complex systems has been studied by several authors, obtaining ...
This work has been supported by the Esprit programme through the SECOND project (Esprit-BRA No. 6769...
Scientific computing and image processing applications access large amounts of data in r...
Parallel disk systems provide opportunities for exploiting I/O parallelism in two possible ways, nam...