Sciweavers

Share
SIAMCOMP
2000

Computations of Uniform Recurrence Equations Using Minimal Memory Size

9 years 5 months ago
Computations of Uniform Recurrence Equations Using Minimal Memory Size
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous processors. This result is then applied to register minimization for digital circuits and parallel computation of task graphs. Keywords uniform recurrence equation, register minimization, circuit design, task graph, (max,+) linear system. Partially supported by the European Grant BRA-QMIPS of CEC DG XIII. LORIA/INRIA Lorraine, 615, rue du jardin botanique, B.P.101, 54602 Villers-les-Nancy Cedex, France INRIA Sophia-Antipolis, B.P. 93, 06902 Sophia Antipolis Cedex, France
Bruno Gaujal, Alain Jean-Marie, Jean Mairesse
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where SIAMCOMP
Authors Bruno Gaujal, Alain Jean-Marie, Jean Mairesse
Comments (0)
books