Code composition as an implementation language for compilers

Authors:
James M. Stichnoth;Thomas Gross
Affiliations:
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Venue:
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Year:
1997

Citing 20
Cited 4

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Steps Toward Architecture-Independent Image Processing

Computer
A manual for the multiblock PARTI runtime primitives revision 4

A manual for the multiblock PARTI runtime primitives revision 4
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Programmable syntax macros

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Exploiting task and data parallelism on a multicomputer

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Compiling Fortran 90D/HPF for distributed memory MIMD computers

Journal of Parallel and Distributed Computing - Special issue on data parallel algorithms and programming
Generating communication for array statements: design, implementation, and evaluation

Journal of Parallel and Distributed Computing - Special issue on data parallel algorithms and programming
Generating local addresses and communication sets for data-parallel programs

Journal of Parallel and Distributed Computing
A linear-time algorithm for computing the memory access sequence in data-parallel programs

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
A manual for the CHAOS runtime library

A manual for the CHAOS runtime library
Fast, effective dynamic compilation

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Compiling array expressions for efficient execution on distributed-memory machines

Journal of Parallel and Distributed Computing
Efficient computation of address sequences in data parallel programs using closed forms for basis vectors

Journal of Parallel and Distributed Computing - Special issue on compilation techniques for distributed memory systems
Earthquake ground motion modeling on parallel computers

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Run-time and compile-time support for adaptive irregular problems

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Slicing Analysis and Indirect Accesses to Distributed Arrays

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Using Partial Evaluation in Support of Portability, Reusability, and Maintainability

CC '96 Proceedings of the 6th International Conference on Compiler Construction
Efficient Compilation of Array Statements for Private Memory Multicomputers

Efficient Compilation of Array Statements for Private Memory Multicomputers
A portable machine-independent global optimizer--design and measurements

A portable machine-independent global optimizer--design and measurements

Generative Programming and Active Libraries

Selected Papers from the International Seminar on Generic Programming
Synthesizing Objects

ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
Synthesizing Objects

ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
LLDSAL: a low-level domain-specific aspect language for dynamic code-generation and program modification

Proceedings of the seventh workshop on Domain-Specific Aspect Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Code composition is an effective technique for a compiler to implement complex high-level operations. The developer (i.e., the language designer or compiler writer) provides building blocks consisting of sequences of code written in, e.g., C, that are combined by a composition system to generate the code for such a high-level operation. The composition system can include optimizations not commonly found in compilers; e.g., it can specialize the code sequences based on loop nesting depth or procedure parameters. We describe a composition system, Catacomb, and illustrate its use for mapping array operations onto a parallel system.