Computations of Uniform Recurrence Equations Using Minimal Memory Size
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...