Abstract
We consider a system of uniform recurrence equations of dimension 1 and 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have