Structuration of the ALPHA language

Authors:
F. de Dinechin;P. Quinton;T. Risset
Affiliations:
-;-;-
Venue:
PMMP '95 Proceedings of the conference on Programming Models for Massively Parallel Computers
Year:
1995

Citing 0
Cited 6

Models and languages for parallel computation

ACM Computing Surveys (CSUR)
Structured Scheduling of Recurrence Equations: Theory and Practice

Embedded Processor Design Challenges: Systems, Architectures, Modeling, and Simulation - SAMOS
Scheduling Structured Systems

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Structured scheduling of recurrence equations: theory and practice

Embedded processor design challenges
Libraries of schedule-free operators in Alpha

ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
Array-OL with delays, a domain specific specification language for multidimensional intensive signal processing

Multidimensional Systems and Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents extensions to ALPHA, a language based upon the formalism of affine recurrence equations (AREs). These extensions address the need for parametric and structured systems of such AREs. Similar to, but more general than the map operator of classical functional languages, the ALPHA structured techniques provide a dense and powerful description of complex systems referencing each other. Such structured systems of AREs may be interpreted as (or translated into) sequential function calls, hierarchical hardware description, or any SIMD flavour of structured programming. With the help of examples, we give an overview of these techniques, and their substitution semantics based on the homomorphic extension of convex polyhedra and affine functions.