Pure data-parallel languages such as High Performance Fortran version 1 (HPF) do not allow efficient expression of mixed task/data-parallel computations or the coupling of separately compiled data-parallel modules. In this paper, we show how these common parallel program structures can be represented, with only minor extensions to the HPF model, by using a coordination library based on the Message Passing Interface (MPI). This library allows data-parallel tasks to exchange distributed data structures using calls to simple communication functions. We present microbenchmark results that characterize the performance of this library and that quantify the impact of optimizations that allow reuse of communication schedules in common situations. I...
In this paper, we present the first, preliminary results of HPF/Fortran-D language analysis based on...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
Many computations can be structured as sets of communicating data-parallel tasks. Individual tasks m...
The data-parallel language High Performance Fortran (HPF) does not allow efficient expression of mix...
High Performance Fortran (HPF) does not allow ecient expression of mixed task/data-parallel computat...
The data-parallel language High Performance Fortran (HPF) does not allow efficient expression of mix...
High Performance Fortran (HPF) has emerged as a standard dialect of Fortran for data-parallel comput...
Data-parallel languages such as High Performance Fortran (HPF) present a simple execution model in w...
Data-parallel languages such as High Performance Fortran (HPF) present a simple execution model in w...
The definition of High Performance Fortran (HPF) is a significant event in the maturation of paralle...
A programming paradigm is a method for structuring programs in order to reduce the complexity of the...
High-Performance Fortran as currently dened cannot be used to solve all program-ming problems. Howev...
Many programming models for massively parallel machines exist, and each has its advantages and disad...
High Performance Fortran (HPF) is a data-parallel language that was designed to provide the user wit...
Advances in computing and networking infrastructure have enabled an increasing number of application...
In this paper, we present the first, preliminary results of HPF/Fortran-D language analysis based on...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
Many computations can be structured as sets of communicating data-parallel tasks. Individual tasks m...
The data-parallel language High Performance Fortran (HPF) does not allow efficient expression of mix...
High Performance Fortran (HPF) does not allow ecient expression of mixed task/data-parallel computat...
The data-parallel language High Performance Fortran (HPF) does not allow efficient expression of mix...
High Performance Fortran (HPF) has emerged as a standard dialect of Fortran for data-parallel comput...
Data-parallel languages such as High Performance Fortran (HPF) present a simple execution model in w...
Data-parallel languages such as High Performance Fortran (HPF) present a simple execution model in w...
The definition of High Performance Fortran (HPF) is a significant event in the maturation of paralle...
A programming paradigm is a method for structuring programs in order to reduce the complexity of the...
High-Performance Fortran as currently dened cannot be used to solve all program-ming problems. Howev...
Many programming models for massively parallel machines exist, and each has its advantages and disad...
High Performance Fortran (HPF) is a data-parallel language that was designed to provide the user wit...
Advances in computing and networking infrastructure have enabled an increasing number of application...
In this paper, we present the first, preliminary results of HPF/Fortran-D language analysis based on...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
Many computations can be structured as sets of communicating data-parallel tasks. Individual tasks m...