Results 1  10
of
65,838
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
Separating Solution of a Recurrent Equation by
"... Consider a sequence of real numbers given by a recurrent equation ∧p = 1 p − 1 ..."
Abstract
 Add to MetaCart
Consider a sequence of real numbers given by a recurrent equation ∧p = 1 p − 1
Converting affine recurrence equations to quasiuniform recurrence equations
 In AWOC 1988: Third International Workshop on Parallel Computation and VLSI Theory
, 1988
"... Most work on the problem of synthesizing a systolic array from a system of recurrence equations is restricted to systems of uniform recurrence equations. Recently, researchers have begun to relax this restriction to include systems of affine recurrence equations. A system of uniform recurrence equat ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Most work on the problem of synthesizing a systolic array from a system of recurrence equations is restricted to systems of uniform recurrence equations. Recently, researchers have begun to relax this restriction to include systems of affine recurrence equations. A system of uniform recurrence
The Mapping of Linear Recurrence Equations on Regular Arrays
 Journal of VLSI Signal Processing
, 1989
"... The parallelization of many algorithms can be obtained using spacetime transformations which are applied on nested doloops or on recurrence equations. In this paper, we analyze systems of linear recurrence equations, a generalization of uniform recurrence equations. The first part of the paper des ..."
Abstract

Cited by 69 (7 self)
 Add to MetaCart
The parallelization of many algorithms can be obtained using spacetime transformations which are applied on nested doloops or on recurrence equations. In this paper, we analyze systems of linear recurrence equations, a generalization of uniform recurrence equations. The first part of the paper
Solving Linear Recurrence Equations
"... The software to be presented is an implementation of the algorithms in [1], [2], and [3]. (This software is available at [4].) The main algorithm in [3] is currently implemented with additional base equations beyond what appear in [3] and will be part of the software demonstration in July. Common to ..."
Abstract
 Add to MetaCart
The software to be presented is an implementation of the algorithms in [1], [2], and [3]. (This software is available at [4].) The main algorithm in [3] is currently implemented with additional base equations beyond what appear in [3] and will be part of the software demonstration in July. Common
The Naive Execution of Affine Recurrence Equations
 INTERNATIONAL CONFERENCE ON APPLICATIONSPECIFIC ARRAY PROCESSORS
, 1995
"... In recognition of the fundamental relation between regular arrays and systems of affine recurrence equations, the Alpha language was developed as the basis of a computer aided design methodology for regular array architectures. Alpha is used to initially specify algorithms at a very high algorith ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
In recognition of the fundamental relation between regular arrays and systems of affine recurrence equations, the Alpha language was developed as the basis of a computer aided design methodology for regular array architectures. Alpha is used to initially specify algorithms at a very high
Stability In A Nonlinear FourTerm Recurrence Equation∗
, 2003
"... In this paper, we provide sufficient conditions for the existence of unbounded solutions and the global attractivity of solutions of a fourterm recurrence equation. 1 ..."
Abstract
 Add to MetaCart
In this paper, we provide sufficient conditions for the existence of unbounded solutions and the global attractivity of solutions of a fourterm recurrence equation. 1
ORTHOGONAL POLYNOMIALS AND RECURRENCE EQUATIONS, OPERATOR EQUATIONS AND FACTORIZATION
, 2007
"... This article surveys the classical orthogonal polynomial systems of the Hahn class, which are solutions of secondorder differential, difference ordifference equations. Orthogonal families satisfy threeterm recurrence equations. Example applications of an algorithm to determine whether a threeter ..."
Abstract
 Add to MetaCart
This article surveys the classical orthogonal polynomial systems of the Hahn class, which are solutions of secondorder differential, difference ordifference equations. Orthogonal families satisfy threeterm recurrence equations. Example applications of an algorithm to determine whether a three
Parallel solutions of indexed recurrence equations
 In IPPS'97
, 1997
"... A new type of recurrence equations called “indexed recurrences” (IR) is defined, in which the common notion of X[i] = op(X[i];X[i,1]) i = 1:::nis generalized to X[g(i)] = op(X[f(i)];X[h(i)]) f; g; h: f1:::ng7! f1:::mg. This enables us to model sequential loops of the form for i = 1ton do begin X[g ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A new type of recurrence equations called “indexed recurrences” (IR) is defined, in which the common notion of X[i] = op(X[i];X[i,1]) i = 1:::nis generalized to X[g(i)] = op(X[f(i)];X[h(i)]) f; g; h: f1:::ng7! f1:::mg. This enables us to model sequential loops of the form for i = 1ton do begin X
Mapping Linear Recurrence Equations onto Systolic Architectures
"... In this paper, we describe a methodology for mapping normal linear recurrence equations onto a spectrum of systolic architectures. First, we provide a method to map a system of directed recurrence equations, a subclass of linear recurrence equations, onto a very general architecture referred to a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, we describe a methodology for mapping normal linear recurrence equations onto a spectrum of systolic architectures. First, we provide a method to map a system of directed recurrence equations, a subclass of linear recurrence equations, onto a very general architecture referred
Results 1  10
of
65,838