Parallel solution of recurrences on a tree machine

DOI10.1007/BF00977832zbMath0569.68033OpenAlexW2044502143MaRDI QIDQ3686036

Roy P. Pargas

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00977832

zbMATH Keywords

parallel computationtree-structured network of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• A network of microprocessors to execute reduction languages, part I
• An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines
• Parallel Solution of Recurrence Problems
• Time and Parallel Processor Bounds for Linear Recurrence Systems
• The Complexity of Parallel Evaluation of Linear Recurrences
• Can programming be liberated from the von Neumann style?
• Communicating sequential processes
• Practical Parallel Band Triangular System Solvers
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

This page was built for publication: Parallel solution of recurrences on a tree machine