Crystal: theory and pragmatics of generating efficient parallel code

Chen, Marina; Choo, Young-il; Li, Jingke

doi:10.1145/107214.129259

Cited by 40 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is typical of Fortran programs, where high performance often is essential, but this information is also clearly visible in functional programming. Many of the more advanced compiler optimisation strategies were discovered for functional programming languages, such as Crystal [13] and later adapted for imperative languages [60].…”

Section: Data Dependencies and Parallelisationmentioning

confidence: 99%

Case Study on Algebraic Software Methodologies for Scientific Computing

Haveraaen

2000

Scientific Programming

View full text Add to dashboard Cite

The use of domain specific languages and appropriate software architectures are currently seen as the way to enhance reusability and improve software productivity. Here we outline a use of algebraic software methodologies and advanced program constructors to improve the abstraction level of software for scientific computing. This leads us to the language of coordinate free numerics as an alternative to the traditional coordinate dependent array notation. This provides the backdrop for the three accompanying papers:Coordinate Free Programming of Computational Fluid Dynamics Problems, centered around an example of using coordinate free numerics,Machine and Collection Abstractions for User-Implemented Data-Parallel Programming, exploiting the higher abstraction level when parallelising code, andAn Algebraic Programming Style for Numerical Software and its Optimization, looking at high-level transformations enabled by the domain specific programming style.

show abstract

Section: Data Dependencies and Parallelisationmentioning

confidence: 99%

Case Study on Algebraic Software Methodologies for Scientific Computing

Haveraaen

2000

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…Alpha was initially introduced to express systolic algorithms, and may seem too restricted to express less regular programs. A possibility is to relax the affinity restriction, as in the systolic language Crystal (Chen et al, 1991), but the static analyses lose their precision.…”

Section: Related Workmentioning

confidence: 99%

Compilation of a specialized functional language for massively parallel computers

Fradet

Mallet

2000

J. Funct. Prog.

View full text Add to dashboard Cite

We propose a parallel specialized language that ensures portable and cost-predictable implementations on parallel computers. The language is basically a first-order, recursion-less, strict functional language equipped with a collection of higher-order functions or skeletons. These skeletons apply on (nested) vectors and can be grouped into four classes: computation, reorganization, communication and mask skeletons. The compilation process is described as a series of transformations and analyses leading to SPMD-like functional programs which can be directly translated into real parallel code. The language restrictions enforce a programming discipline whose benefit is to allow a static, symbolic and accurate cost analysis. The parallel cost takes into account both load balancing and communications, and can be statically evaluated even when the actual size of vectors or the number of processors are unknown. It is used to automatically select the best data distribution among a set of standard distributions. Interestingly, this work can be seen as a cross-fertilization between techniques developed within the FORTRAN parallelization, skeleton and functional programming communities.

show abstract

“…Then the layout conversion of D from B 1 to B 2 is given by the communication expression θ = g 2 g −1 1 , as shown in Figure 4(c). Most of the HPF alignment operators are reshape morphisms [10], which essentially are bijective functions defined over index domains. For an operator f : D → E which is injective but not bijective, a reshape morphism f : Figure 5 shows a simple communication expression for inter-procedural data movement.…”

Section: Inter-procedural Data Movementmentioning

confidence: 99%

CRAFT: a framework for F90/HPF compiler optimizations

Chen

Cowie

1999

Concurrency: Pract. Exper.

Self Cite

View full text Add to dashboard Cite

In this paper, we give an overview of the results of the CRAFT optimising compiler project (Fortran 90/HPF subset compilers). We start by describing the theoretical framework within which we designed program transformations for the optimization of inter‐ and intra‐procedural data motion, as well as the optimizations for parallel loops; we then describe the implementation of the CRAFT compilers for Thinking Machines' CM‐2 and CM‐5. We report results from experiments on the Connection Machine CM‐5, the IBM SP‐2 and a network of UltraSparc workstations. The results demonstrate that these optimizations can achieve significant object code performance improvement. Copyright © 1999 John Wiley & Sons, Ltd.

show abstract

Crystal: theory and pragmatics of generating efficient parallel code

Cited by 40 publications

References 0 publications

Case Study on Algebraic Software Methodologies for Scientific Computing

Case Study on Algebraic Software Methodologies for Scientific Computing

Compilation of a specialized functional language for massively parallel computers

CRAFT: a framework for F90/HPF compiler optimizations

Contact Info

Product

Resources

About