Optimal parallel algorithms for solving tridiagonal linear systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1300 LNCS, Issue , 1997, Pages 700-709

  Santos, Eunice E ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS;

ASYMPTOTIC BOUNDS; CONSTANT FACTORS; CYCLIC REDUCTION; DATA LAYOUTS; DIRECT METHOD; DISTRIBUTED MEMORY MACHINES; NUMBER OF DATUM; RUNNING TIME;

LINEAR SYSTEMS;

EID: 84870926569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002802     Document Type: Conference Paper

References (12)

1. C. Amodio and N. Mastronardi. A parallel version of the cyclic reduction algorithm on a hypercube. Parallel Computing, 19, 1993.
2. D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahay, E. Santos, K. E. Schauser, R. Subramonian, and T. von Eicken. LogP: A Practical Model of Parallel Computation. Communications of the ACM, May 1996.
3. D. Heller. A survey of parallel algorithms in numerical linear algebra. SIAM J. Numer. Anal, 29(4), 1987.
4. A. W. Hockney and C. R. Jesshope. Parallel Computers. Adam-Hilger, 1981.
5. S. L. Johnsson. Solving tridiagonal systems on ensemble architectures. SIAM J. Sci. Stat. Comput., 8, 1987.
6. R. M. Karp, A. Sahay, E. E. Santos, and K.E. Schauser Optimal Broadcast and Summation on the LogP Model. In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, 1993.
7. S. P. Kumar. Solving tridiagonal systems on the butterfly parallel computer. International J. Supercomputer Applications, 3, 1989.
8. S. Lakshmivarahan and S. D. Dhall. A Lower Bound on the Communication Complexity for Solving Linear Tridiagonal Systems on Cube Architectures. In Hyper-cubes 1987, 1987.
9. S. Lakshmivarahan and S. D. Dhall. Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems. McGraw-Hill, 1990.
10. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufmann, 1992.
11. E. E. Santos. Direct methods for solving tridiagonal linear systems in parallel. Technical Report TR-95-029, International Computer Science Institute, 1995.
12. E. E. Santos. Optimal and efficient parallel algorithms for summing and prefix summing. In Proceedings of the Eighth Annual IEEE Symposium on Parallel and Distributed Processing, 1996.