Results 1 
5 of
5
Models and Languages for Parallel Computation
 ACM COMPUTING SURVEYS
, 1998
"... We survey parallel programming models and languages using 6 criteria [:] should be easy to program, have a software development methodology, be architectureindependent, be easy to understand, guranatee performance, and provide info about the cost of programs. ... We consider programming models in ..."
Abstract

Cited by 168 (4 self)
 Add to MetaCart
(Show Context)
We survey parallel programming models and languages using 6 criteria [:] should be easy to program, have a software development methodology, be architectureindependent, be easy to understand, guranatee performance, and provide info about the cost of programs. ... We consider programming models in 6 categories, depending on the level of abstraction they provide.
AlphaZ: A System for Analysis, Transformation, and Code Generation in the Polyhedral Equational Model
, 2012
"... ..."
GENERATING REGULAR ARITHMETIC CIRCUITS with AlpHard
 In Massively Parallel Computing Systems (MPCS'96
, 1996
"... : The efficient vlsi implementation of arithmetics operators requires that design be optimized, both by looking for efficient algorithms, and by producing compact regular layouts. We present AlpHard, a subset of Alpha  a language for the synthesis of regular algorithms. AlpHard is intended for spe ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
: The efficient vlsi implementation of arithmetics operators requires that design be optimized, both by looking for efficient algorithms, and by producing compact regular layouts. We present AlpHard, a subset of Alpha  a language for the synthesis of regular algorithms. AlpHard is intended for specifying the Register Transfer Level (RTL) representation of an architecture, in such a way that any regularity in the algorithm is preserved. An AlpHard description can be obtained as the result of a formal derivation process, thus enabling different solutions to be found automatically from Alpha programs. In this paper we demonstrate the effectiveness of AlpHard on the derivation of regular layouts for a two's complement bitserial multiplier. Keywords: high level synthesis, regular arrays, vlsi, arithmetic (R'esum'e : tsvp) To appear in the Proceedings of 2th International Conference on Massively Parallel Computing Systems (MPCS'96)  Ischia, Italy  69 May 1996 This research is par...
Hierarchical static analysis of structured systems of affine recurrence equations
 In ASAP
, 1996
"... The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures of such systems. This paper discusses the static analysis of Alpha programs, an extended typechecking process based on t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures of such systems. This paper discusses the static analysis of Alpha programs, an extended typechecking process based on the single assignment rule. We present techniques ensuring, on one hand, that a system is valid (with respect to this rule) within a certain range of its parameters, and on the other, that no system is used with invalid values of its parameters. These techniques have been implemented in a versatile tool for Alpha which is demonstrated on the example of the Gaussian elimination. 1
Structured Scheduling of Recurrence Equations
"... We study scheduling of structured systems of recurrence equations. We first recall the formalism of structured systems of recurrence equations, then we explain how to implement a scheduling tool for nonstructured systems of reccurence equations. We introduce the notion of structured schedule and pr ..."
Abstract
 Add to MetaCart
We study scheduling of structured systems of recurrence equations. We first recall the formalism of structured systems of recurrence equations, then we explain how to implement a scheduling tool for nonstructured systems of reccurence equations. We introduce the notion of structured schedule and propose criteria for determining whether a structured system of reccurence equations admits a structured schedule. We give an algorithm for its computation. Finaly we propose an algorithm for computing structured multidimensionnal schedule for systems which do not admit a structured linear schedule. With this last method, we derive a structured schedule for a structured system of recurrence equations computing the singular value decomposition of a matrix.