High Performance Fortran is a language designed to support efficient data parallel programming on a variety of parallel machines. This kind of parallelprogramming has been proven to be very user-friendly, easy to deb...
详细信息
High Performance Fortran is a language designed to support efficient data parallel programming on a variety of parallel machines. This kind of parallelprogramming has been proven to be very user-friendly, easy to debug and easy to use. In this programming model, the programmer explicitly specifies the layout of data in a global space, relying on a compiler to generate a parallel program including all the communication. While this frees the programmers from the tedium of thinking about local name spaces and message-passing, no assistance is provided in determining an efficient data layout scheme on the target *** programming Translator (PPTran) is a compilation system that transforms dataparallel programs written in High Performance Fortran (HPF) with array extensions, parallel loops, and layout directives to parallel programs with explicit message passing using parallel Virtual Machine (PVM) library.
This article presents the benchmarking by BERTIN (F) of the SUPERNODE SN1000 parallel architecture from PARSYS within the framework of the BECAUSE Project. This evaluation of a Distributed Memory parallel architecture...
详细信息
This article presents the benchmarking by BERTIN (F) of the SUPERNODE SN1000 parallel architecture from PARSYS within the framework of the BECAUSE Project. This evaluation of a Distributed Memory parallel architecture was realised by means of the BECAUSE Benchmark Set (BBS). The very strong idea was to specify parallelisation methodologies and to develop parallel software which are machine independent and as such portable. This approach was possible and realistic since the principle of parallelism which is involved is the data parallel programming. As a consequence, the hardware features of the target architecture are transparent to the industrial user and are managed through a communication library called 3P PARLIB. In this paper, principles of parallelisation which were used are presented. Practical implementation of these parallelisation principles is illustrated with various significant Test Programs from the BBS. The corresponding results are presented. Specifications for the 3P PARLIB (Portable parallelprogramming library) are also given.
We describe dataparallel list operations that exploit pair structure on lists and an algebra that relates them. Equations from the algebra are used as transformation rules, so that development is done in a calculatio...
详细信息
We describe dataparallel list operations that exploit pair structure on lists and an algebra that relates them. Equations from the algebra are used as transformation rules, so that development is done in a calculational way. We illustrate their use in applications such as FFTs and sorting, and show that optimal or near-optimal algorithms can result from a systematic calculational process. The operations have a natural, direct implementation on hypercubes.
We investigate the problem of evaluating Fortran 90-style array expressions on massively parallel distributed-memory machines. On such a machine, an elementwise operation can be performed in constant time for arrays w...
详细信息
We investigate the problem of evaluating Fortran 90-style array expressions on massively parallel distributed-memory machines. On such a machine, an elementwise operation can be performed in constant time for arrays whose corresponding elements are in the same processor. If the arrays are not aligned in this manner, the cost:of aligning them is part of the cost of evaluating the expression tree. The choice of where to perform the operation then affects this cost. We describe the communication cost of the parallel machine theoretically as a metric space;we model the alignment problem as that of finding a minimum-cost embedding of the expression tree into this space. We present algorithms based on dynamic programming that solve the embedding problem optimally for several communication cost metrics: multidimensional grids and rings, hypercubes, fat-trees, and the discrete metric. We also extend out approach to handle operations that change the shape of the arrays.
A major reason for the lack of practical use of parallel computers has been the absence of a suitable model of parallel computation. Many existing models are either theoretical or are tied to a particular architecture...
详细信息
A major reason for the lack of practical use of parallel computers has been the absence of a suitable model of parallel computation. Many existing models are either theoretical or are tied to a particular architecture. A more general model must be architecture independent, must realistically reflect execution costs, and must reduce the cognitive overhead of managing massive parallelism. A growing number of models meeting some of these goals have been suggested. We discuss their properties and relative strengths and weaknesses. We conclude that dataparallelism is a style with much to commend it, and discuss the Bird-Meertens formalism as a coherent approach to data parallel programming.
暂无评论