- 1 BANK, R E, AND ROSE, D J An O(n2) method for solving constant coefficmnt boundary value problems m two dimensions SIAM J Numer Anal 12, 4 (Sept 1975), 529-540Google Scholar
- 2 BORODIN, A, AND MUNRO, I. Computational Complexity of Algebratc and Numertc Problems American Elsevmr, New York, 1975Google Scholar
- 3 CHEN, S C, Speedup of tteratwe programs in multtprocessor systems. Ph.D. Th., Rep. No. 75-694, Dept Comptr Scl., U of ilhnols at Urbana-Champalgn, Jan 1975 Google Scholar
- 4 CHEN, S.C., AND KUCK, D J Time and parallel processor bounds for linear recurrence systems. IEEE Trans Comptr C-24, 7, (July 1975), 701-717Google Scholar
- 5 CHEN, S C, AND SAMEH, A.H On parallel triangular system solvers Proc. 1975 Sagamore Comptr. Conf on Parallel Processmg, Aug 1975, pp 237-238Google Scholar
- 6 HELLER, D. On the efficmnt computation of recurrence relations Inst for Comptr Appl. in Scl. and Eng. (ICASE), NASA Langley Res Ctr, Hampton, Va, June 1974Google Scholar
- 7 HYAFIL, L, ANY) KUNG, H T The complexity of parallel evaluation of linear recurrence. J ACM 24, 3 (July 1977), 513-521. Google Scholar
- 8 KUCK, D J. Parallel processing of ordinary programs Advances m Computers 15 (1976), 119-179.Google Scholar
- 9 KtJCK, D.J, BUDNIK, P, CHEN, S.C, DAVIS, E, JR, HAN, J, KRASKA, P., LAWI~IE, D, MtmAOKA, Y, STREBENDT, R, AND TOWLE, R. Measurements of parallelism m ordinary FORTRAN programs. IEEE Comptr. 7, 1 (Jan 1974), 37-46.Google Scholar
- 10 LAFON, J Base tensormlle des matrices de Hankel (on de Toephtz) Applications. Nurner. Math. 23 (1975), 349-361Google Scholar
- 11 OrtCWTW, S.E. Parallel solution methods for triangular hnear systems of equations Tech. Rep No 77, Digital Syst Lab., Stanford Electronics Labs, Stanford, Cahf., 1974 Google Scholar
- 12 SAMEH, A H., AND BRENT, R P. Solving triangular systems on a parallel computer SIAM J. Numer Analysts 14, 6 (Dec 1977), 1101-1113Google Scholar
- 13 STOKES, R BSP The Burroughs SclenUfic Processor. In Hzgh Speed Computer and Algortthm Orgamzatton, D Kuck, D. Lawrm, and A Sameh, Eds Academm Press, New York, 1977Google Scholar
Index Terms
- Practical Parallel Band Triangular System Solvers
Recommendations
Performance Evaluation of MPI Implementations and MPI-Based Parallel ELLPACK Solvers
MPIDC '96: Proceedings of the Second MPI Developers ConferenceAbstract: We are concerned with the parallelization of finite element mesh generation and its decomposition, and the parallel solution of sparse algebraic equations which are obtained from the parallel discretization of second order elliptic partial ...
Load-balanced parallel banded-system solvers
Solving banded systems is important in the applications of science and engineering. This paper presents a load-balancing strategy for solving banded systems in parallel when the number of processors used is small. An optimization-based load-balancing ...
Parallel Triangular System Solving on a Mesh Network of Transputers
A parallel algorithm is presented for triangular system solving on a distributed-memory MIMD computer with a square mesh topology. The algorithm is based on the square grid (scattered) distribution of matrix elements across the processors. The ...
Comments