Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
IEEE Transactions on Computers
Regular interactive algorithms and their implementations on processor arrays
Regular interactive algorithms and their implementations on processor arrays
Theory of linear and integer programming
Theory of linear and integer programming
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
VLSI array processors
Systolic array synthesis: computability and time cones
Proceedings of the international workshop on Parallel algorithms & architectures
LUSTRE: a declarative language for real-time programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Dynamic programming on two-dimensional systolic arrays
Information Processing Letters
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Lucid, a nonprocedural language with iteration
Communications of the ACM
The parallel execution of DO loops
Communications of the ACM
Introduction to VLSI Systems
Data broadcasting in linearly scheduled array processors
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Towards Systolizing Compilation: an Overview
Towards Systolizing Compilation: an Overview
Space-time algorithms: semantics and methodology (crystal)
Space-time algorithms: semantics and methodology (crystal)
Application-specific Processor Architecture: Then and Now
Journal of Signal Processing Systems
Hi-index | 0.00 |
We describe Alpha du Centaur (ADC), a prototype environment for the design of parallel regular algorithms. In ADC, a program is specified using the Alpha language, using system of parameterized linear recurrence equations. The goal of ADC is to make it possible to transform the initial specifications into a parallel algorithm, that is to say, another system of recurrence equations, in which the time and the space index are separated.The first section of the paper is devoted to a presentation of the model underlying ADC, i.e., system of recurrence equations. The second section summarizes briefly the knowledge we have on this formalism, and presents some open problems. In the third section, we describe the architecture of ADC, which is based on the CENTAUR environment, and we present an example of utilization of ADC for designing a simple algorithm.