An approach to distributed memory parallel programming that has recently become popular is one where the programmer explicitly specifies the data decomposition using language extensions, and a compiler generates all the communication. While this frees the programmer from the tedium of thinking about message-passing, no assistance is provided in determining the data decomposition scheme that gives the best performance on the target machine. In this paper, we propose an interactive software tool that provides assistance for this very task. The proposed tool also computes performance estimates for any chosen data partitioning scheme, allowing the programmer to experiment with several different strategies without ever running the program on ...
Many problems currently require more processor throughput than can be achieved with current single-p...
This paper outlines two methods which we believe will play an important role in any distributed memo...
Automatic Global Data Partitioning for Distributed Memory Machines (DMMs) is a difficult problem. Di...
An approach to distributed memory parallel programming that has recently become popular is one wher...
An approach to programming distributed memory-parallel machines that has recently become popular is ...
160 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.Distributed-memory parallel c...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
Distributed-memory parallel computers are increasingly being used to provide high levels of performa...
For distributed memory multicomputers such as the Intel Paragon, the IBM SP-2, the NCUBE/2, and the ...
Estimating communication cost involved in executing a program on distributed memory machines is impo...
this report we have described how two methods for automatically determining convenient data distribu...
This paper proposes a compiler strategy for mapping FORTRAN programs onto distributed memory compute...
An important problem facing numerous research projects on parallelizing compilers for distributed me...
We consider distribution at compile time of the array data in a distributed-memory implementation of...
Many problems currently require more processor throughput than can be achieved with current single-p...
This paper outlines two methods which we believe will play an important role in any distributed memo...
Automatic Global Data Partitioning for Distributed Memory Machines (DMMs) is a difficult problem. Di...
An approach to distributed memory parallel programming that has recently become popular is one wher...
An approach to programming distributed memory-parallel machines that has recently become popular is ...
160 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.Distributed-memory parallel c...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
Distributed-memory multicomputers, such as the Intel iPSC/860, the Intel Paragon, the IBM SP-1 /SP-2...
Distributed-memory parallel computers are increasingly being used to provide high levels of performa...
For distributed memory multicomputers such as the Intel Paragon, the IBM SP-2, the NCUBE/2, and the ...
Estimating communication cost involved in executing a program on distributed memory machines is impo...
this report we have described how two methods for automatically determining convenient data distribu...
This paper proposes a compiler strategy for mapping FORTRAN programs onto distributed memory compute...
An important problem facing numerous research projects on parallelizing compilers for distributed me...
We consider distribution at compile time of the array data in a distributed-memory implementation of...
Many problems currently require more processor throughput than can be achieved with current single-p...
This paper outlines two methods which we believe will play an important role in any distributed memo...
Automatic Global Data Partitioning for Distributed Memory Machines (DMMs) is a difficult problem. Di...