An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Journal of the ACM (JACM)
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
New algorithms and lower bounds for the parallel evaluation of certain rational expressions
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Upper Bounds for Speedup in Parallel Parsing
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
The concept of computers such as C.mmp and ILLIAC IV is to achieve computational speed-up by performing several operations simultaneously with parallel processors. This type of computer organization is referred to as a parallel computer. In this paper, we prove upper bounds on speed-ups achievable by parallel computers for a particular problem, the solution of first order linear recurrences. We consider this problem because it is important in practice and also because it is simply stated so that we might obtain some insight into the nature of parallel computation by studying it.