A method for parallel program generation with an application to the
            <i>Booster</i>
            language

Paalvast, E.M.; Gemund, Arjan J. van; Sips, Henk

doi:10.1145/77726.255189

Cited by 17 publications

(1 citation statement)

References 9 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Paalvast et al [17] describe SPMD code generation for a highlevel, parallel, programming language called Booster using a functional calculus called the view calculus. No benchmarks of any Booster implementation are provided.…”

Section: Related Workmentioning

confidence: 99%

Efficient, portable implementation of asynchronous multi-place programs

Bikshandi

Castaños

Kodali

et al. 2009

Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

The X10 programming language is organized around the notion of places (an encapsulation of data and activities operating on the data), partitioned global address space (PGAS), and asynchronous computation and communication.This paper introduces an expressive subset of X10, FLAT X10, designed to permit efficient execution across multiple singlethreaded places with a simple runtime and without compromising on the productivity of X10. We present the design, implementation and evaluation of a compiler and runtime system for FLAT X10. The FLAT X10 compiler translates programs into C++ SPMD programs communicating using an active messaging infrastructure. It uses novel techniques to transform explicitly parallel programs into SPMD programs. The runtime system is based on IBM's LAPI (Low-level API) and is easily portable to other libraries such as GASNet and ARMCI.Our implementation realizes performance comparable to handwritten MPI programs for well-known HPC benchmarks such as Random Access, Stream, and FFT, on a Federation-based cluster of Power5 SMPs (with hundreds of processors) and the Blue Gene (with thousands of processors). Submissions based on the work presented in this paper were co-winners of the 2007 and 2008 HPC Challenge Type II Awards.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient, portable implementation of asynchronous multi-place programs

Bikshandi

Castaños

Kodali

et al. 2009

Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

show abstract

Generating an efficient compiler for a data parallel language from a denotational specification

Ringström¹,

Fritzson²,

Pettersson³

1994

Lecture Notes in Computer Science

View full text Add to dashboard Cite

There are very few examples of the generation of efficient compilers from denotational specifications. Usually such compilers generate code which is orders of magnitude slower than from handwritten ones. However, as has been demonstrated by our DML (Denotational Meta Language) compiler generation system, through appropriate single-threading analysis it is possible to obtain code of comparable quality to handwritten compilers. Another problem with denotational specifications is, because of their denotational nature, the need to introduce complicated power domains to model non-determinism and parallelism. In this work we have used a more practical two-level approach: use denotational specifications to model the meaning of the source language in terms of an abstract machine of low-level operations, including data-parallel operations. Then use operational semantics for the specification of this abstract machine. This paper reports experience from building a prototype compiler for a small Algollike parallel language using a version of the DML system called DML-P, which has been extended to support data-parallel operations. The final code contains calls to a portable data-parallel vector code library (VCODE CVL). The speed of generated compilers are within a factor of three from handwritten ones. Extensive benchmarks of a DML-P generated compiler are presented.

show abstract

Code generation for data parallel programs on DMPCs

Pazat

1991

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A method for parallel program generation with an application to the Booster language

Cited by 17 publications

References 9 publications

Efficient, portable implementation of asynchronous multi-place programs

Efficient, portable implementation of asynchronous multi-place programs

Generating an efficient compiler for a data parallel language from a denotational specification

Code generation for data parallel programs on DMPCs

Contact Info

Product

Resources

About