In parallel programs the most important improvements in execution times can be achieved by the optimal placement of data and the optimal assignment of work to the processors in the system. In a simple parallel programming environment this information is entirely specified by the user, but this places a heavy burden on the user. It is much more comfortable for the user if parts of the placement can be left unspecified. However, this means that the user must be able to specify part of the data placement and work assignment, and it must be clear which data placements and work assignment are left to the compiler. The compiler must then find the optimal choices for the placements that the user has left unspecified. In this paper we present a com...
How can we provide data where it is required and when it is required to the execution units of para...
This paper describes two new ideas by which an HPF compiler can deal with irregular computations eff...
This paper presents a new approach towards solving the combination and communication problems betwee...
For a wide variety of applications, both task and data parallelism must be exploited to achieve the ...
This paper presents compiler algorithms to optimize out-of-core programs. These algorithms consider ...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
Data-parallel languages, such as H scIGH P scERFORMANCE F scORTRAN or F scORTRAN D, provide a machin...
This paper presents a new approach towards solving the combination and communication problems betwee...
Data-parallel languages allow programmers to use the familiar machine-independent programming style ...
We present a unified approach to locality optimization that employs both data and control transforma...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
The performance of a High Performance Parallel or Distributed Computation depends heavily on minimiz...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
We consider the generation of mixed task and data parallel programs and discuss how a clear separati...
While parallel programming is needed to solve large-scale scientific applications, it is more diffic...
How can we provide data where it is required and when it is required to the execution units of para...
This paper describes two new ideas by which an HPF compiler can deal with irregular computations eff...
This paper presents a new approach towards solving the combination and communication problems betwee...
For a wide variety of applications, both task and data parallelism must be exploited to achieve the ...
This paper presents compiler algorithms to optimize out-of-core programs. These algorithms consider ...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
Data-parallel languages, such as H scIGH P scERFORMANCE F scORTRAN or F scORTRAN D, provide a machin...
This paper presents a new approach towards solving the combination and communication problems betwee...
Data-parallel languages allow programmers to use the familiar machine-independent programming style ...
We present a unified approach to locality optimization that employs both data and control transforma...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
The performance of a High Performance Parallel or Distributed Computation depends heavily on minimiz...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/19...
We consider the generation of mixed task and data parallel programs and discuss how a clear separati...
While parallel programming is needed to solve large-scale scientific applications, it is more diffic...
How can we provide data where it is required and when it is required to the execution units of para...
This paper describes two new ideas by which an HPF compiler can deal with irregular computations eff...
This paper presents a new approach towards solving the combination and communication problems betwee...