A three-phase parallel algorithm for solving linear recurrences
From MaRDI portal
Recommendations
Cites work
- A cost-optimal parallel tridiagonal system solver
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
- Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- Parallel Solution of Recurrence Problems
Cited in
(10)- An \(O(\log N)\) algorithm to solve linear recurrences on hypercubes
- Parallel processing of first order linear recurrence on SMP machines
- Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays
- \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations
- Parallel solution of recurrences on a tree machine
- scientific article; zbMATH DE number 3945316 (Why is no real title available?)
- scientific article; zbMATH DE number 3954267 (Why is no real title available?)
- scientific article; zbMATH DE number 1190794 (Why is no real title available?)
- scientific article; zbMATH DE number 54587 (Why is no real title available?)
- scientific article; zbMATH DE number 1135733 (Why is no real title available?)
This page was built for publication: A three-phase parallel algorithm for solving linear recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751856)