The success of large-scale parallel architectures is limited by the diiculty of developing machine-independent parallel programs. We have developed Fortran D, a version of Fortran extended with data decomposition speciications, to provide a portable data-parallel programming model. This paper presents the design of two key components of the Fortran D programming system: a prototype compiler and...

Because of the complexity and variety of parallel archi-tectures, an eecient machine-independent parallel programming model is needed to make parallel computing truly usable for scientiic programmers. We believe that Fortran D, a version of Fortran enhanced with data decomposition speciications, can provide such a programming model. This paper presents the design of a prototype Fortran D compil...

Because of the complexity and variety of parallel archi-tectures, an eecient machine-independent parallel programming model is needed to make parallel computing truly usable for scientiic programmers. We believe that Fortran D, a version of Fortran enhanced with data decomposition speciications, can provide such a programming model. This paper presents the design of a prototype Fortran D compil...

I n May and June 1986, Programming Pearls took up literate programming, an approach to programming espoused by Donald Knuth. Knuth’s premise is that the best programs are meant for people as well as machines; they are meant to be read as well as run. He built a system, WEB, that scans specially structured technical reports to extract Pascal statements interwoven with the text, forming from them...

The effective use of the cache memories of the processors is a key component of obtaining high performance algorithms and codes, including here algorithms and codes for parallel computers with shared and distributed memories. The recursive algorithms seem to be a tool for such an action. Unfortunately, worldwide used programming language FORTRAN 77 does not allow explicit recursion. The paper p...

We propose a new visual programming language, called GRAPNEL (GRAphical Process's NEt Language), for designing distributed parallel programs based on the message passing programming paradigm. GRAPNEL supports graphically the Process Group abstraction and the automatic generation of several regular process topology based on prede ned topology templates. Dynamic process creation and destruction a...

We describe programming language constructs that facilitate the application of modular design techniques in parallel programming. These constructs allow us to isolate resource management and processor scheduling decisions from the speciication of individual modules, which can themselves encapsulate design decisions concerned with concurrency, communication, process mapping, and data distributio...

Compiling irregular applications written in a data-parallel language, like Fortran D or High Performance Fortran (HPF), presents a challenge of growing importance. A major component of data-parallel programming is the data mapping, i.e., data distribution and alignment. Map-pings may be either regular, in which case they correspond to simple functions between array indices and owning processors...

Numerically solving a second quantised many-body model in the permutation symmetric Fock space can be challenging for two reasons: (i) an increased complication calculations of matrix elements various operators, and (ii) poor scaling cost these with size. We present method that solves both problems. find mapping used to simplify elements. The is directly generated so its computational scales on...