V-cal: a calculus for the compilation of data parallel languages

Dechering, P.; Trescher, J.; Vreught, J. P. M. de; Sips, Henk

doi:10.1007/bfb0014195

Cited by 5 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All macros and parameterized classes are expanded, all methods are rewritten to stand-alone functions, etc. The resulting program is represented in our intermediate language Vnus [27]. In the Vnus representation, most language constructs described in this paper are rewritten; only multi-dimensional arrays and the each and foreach constructs remain.…”

Section: Compiling Sparmentioning

confidence: 99%

Spar: A programming language for semi-automatic compilation of parallel programs

Reeuwijk

Gemund

Sips

1997

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

Section: Compiling Sparmentioning

confidence: 99%

Spar: A programming language for semi-automatic compilation of parallel programs

Reeuwijk

Gemund

Sips

1997

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

“…The compiler works on full programs. It consists of a front-end that generates code in the intermediate language Vnus [17], a number of parallelization engines that work on Vnus, and a back-end that converts from Vnus to C++. The compiler contains optimizers that avoid compiling unused code, eliminate and optimize null pointer checks, eliminate static class administration, simplify expressions, and eliminate and optimize bound checks.…”

Section: The Compilermentioning

confidence: 99%

Spar: a set of extensions to Java for scientific computation

Reeuwijk

Kuijlman

Sips

2003

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

SUMMARYWe present a set of language extensions that improve the expressiveness and performance of Java for scientific computation. The language extensions allow the manipulation of multi-dimensional arrays to be expressed more naturally, and to be implemented more efficiently. Furthermore, data-parallel programming is supported, allowing efficient parallelization of a large class of operations on arrays. We also provide language extensions to construct specialized array representations, such as symmetric, block, and sparse matrices. These extensions are: tuples, parameterized types, array subscript overloading, and the inline modifier. These extensions are not only useful in the construction of special array representations, but are also useful in their own right. Finally, we add complex numbers as a primitive type to the language. We evaluate our language extensions using performance results. We also compare relevant code fragments of our extended language with standard Java implementations and language extensions proposed by others.

show abstract

“…Internally, the Timber compiler consists of three modules (Fig. 3): a frontend that translates Spar/Java to an intermediate representation called Vnus [2,8], a number of parallelization engines that rewrite Vnus, and a backend that translates Vnus to C ++ code. To give an indication of the amount of work Tm has saved us, we will show statistics comparing the number of lines of hand-written and generated code 1 .…”

Section: Application Of Tm In the Timber Compilermentioning

confidence: 99%

Rapid and Robust Compiler Construction Using Template-Based Metacompilation

Reeuwijk

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data structures. With this process, Tm is able to generate program code to manipulate these data structures. Since it uses templates, the generated code is not restricted to a specific programming language: any sufficiently powerful programming language can be targeted. Tm has been used for a wide variety of tasks and languages. However, it was designed to support compiler construction, and most applications have been in that area. In this paper we outline Tm, and describe our experiences with using it to construct a static compiler for Java. As we will show, it has significantly accelerated implementation of the compiler. Almost 75% of its source code is generated by Tm, allowing us to rapidly implement a much more robust and sophisticated compiler than would have been possible otherwise.

show abstract

V-cal: a calculus for the compilation of data parallel languages

Cited by 5 publications

References 6 publications

Spar: A programming language for semi-automatic compilation of parallel programs

Spar: A programming language for semi-automatic compilation of parallel programs

Spar: a set of extensions to Java for scientific computation

Rapid and Robust Compiler Construction Using Template-Based Metacompilation

Contact Info

Product

Resources

About