Many programming models for massively parallel machines exist, and each has its advantages and disadvantages. In this article we present a programming model that combines features from other programming models that (1) can be efficiently implemented on present and future Cray Research massively parallel processor (MPP) systems and (2) are useful in constructing highly parallel programs. The model supports several styles of programming: message-passing, data parallel, global address (shared data), and work-sharing. These styles may be combined within the same program. The model includes features that allow a user to define a program in terms of the behavior of the system as a whole, where the behavior of individual tasks is implicit from thi...
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the...
High Performance Fortran (HPF) does not allow ecient expression of mixed task/data-parallel computat...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published ...
FortranM is a small set of extensions to Fortran 77 that supports a modular approach to the design o...
Pure data-parallel languages such as High Performance Fortran version 1 (HPF) do not allow efficient...
We present an overview of research at the Center for Research on Parallel Computation designed to pr...
A programming paradigm is a method for structuring programs in order to reduce the complexity of the...
The data-parallel language High Performance Fortran (HPF) does not allow efficient expression of mix...
We describe parallel extensions of sequential programming languages for writing pro-grams that integ...
Massively parallel processors (MPPs) hold the promise of extremely high performance that, if realize...
Fortran M is a small set of extensions to Fortran 77 that supports a modular approach to the design ...
The goal of the research described in this article is to develop flexible language constructs for wr...
The definition of High Performance Fortran (HPF) is a significant event in the maturation of paralle...
High-Performance Fortran as currently dened cannot be used to solve all program-ming problems. Howev...
Current parallel programming languages support only a narrow range of programming styles; force prog...
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the...
High Performance Fortran (HPF) does not allow ecient expression of mixed task/data-parallel computat...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published ...
FortranM is a small set of extensions to Fortran 77 that supports a modular approach to the design o...
Pure data-parallel languages such as High Performance Fortran version 1 (HPF) do not allow efficient...
We present an overview of research at the Center for Research on Parallel Computation designed to pr...
A programming paradigm is a method for structuring programs in order to reduce the complexity of the...
The data-parallel language High Performance Fortran (HPF) does not allow efficient expression of mix...
We describe parallel extensions of sequential programming languages for writing pro-grams that integ...
Massively parallel processors (MPPs) hold the promise of extremely high performance that, if realize...
Fortran M is a small set of extensions to Fortran 77 that supports a modular approach to the design ...
The goal of the research described in this article is to develop flexible language constructs for wr...
The definition of High Performance Fortran (HPF) is a significant event in the maturation of paralle...
High-Performance Fortran as currently dened cannot be used to solve all program-ming problems. Howev...
Current parallel programming languages support only a narrow range of programming styles; force prog...
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the...
High Performance Fortran (HPF) does not allow ecient expression of mixed task/data-parallel computat...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published ...