Skip to main content
SpringerLink
Log in

Optimal and Efficient Parallel Tridiagonal Solvers Using Direct Methods

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The problem of solving tridiagonal linear systems on parallel distributed-memory environments is considered in this paper. In particular, two common direct methods for solving such systems are considered: odd-even cyclic reduction and prefix summing. For each method, a variety of lower bounds on execution time for solving tridiagonal linear systems are presented. Specifically, lower bounds are presented that (a) hold when the number of data items per processor is bounded, (b) are general lower bounds, and (c) for specific data layouts commonly used in designing parallel algorithms to solve tridiagonal linear systems. Furthermore, algorithms are presented that have running times within a constant factor of the lower bounds provided. Lastly, a comparison of bounds for odd-even cyclic reduction and prefix summing is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Amodio and N. Mastronardi. A parallel version of the cyclic reduction algorithm on a hypercube. Parallel Computing, 19, 1993.

  2. M. Amor et al. Parallelization of a recursive decoupling method for solving tridiagonal linear system on distributed memory computer. VECPAR'2000, 2000.

  3. 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, 39(11):1996.

  4. W. Dally et al. The J-machine: A fine-grain concurrent computer. In IFIP Congress, 1989.

  5. L. E. Garey et al. Parallel projection methods for tridiagonal systems. Proc. HPCS, 2001

  6. G. A. Gravvanis. Solving symmetric arrowhead and special tridiagonal linear systems by fast approximate inverse preconditioning. J. Math. Modelling and Algorithms, 1(4):2002.

  7. D. Heller. A survey of parallel algorithms in numerical linear algebra. SIAM J. Numer. Anal., 29(4):1987.

  8. A. W. Hockney and C. R. Jesshope. Parallel Computers. Adam-Hilger, 1981.

  9. S. L. Johnsson. Solving tridiagonal systems on ensemble architectures. SIAM J. Sci. Stat. Comput., 8,1987.

  10. 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.

  11. S. P. Kumar. Solving tridiagonal systems on the butterfly parallel computer. International J. Supercomputer Applications, 3,1989.

  12. S. Lakshmivarahan and S. D. Dhall. A lower bound on the communication complexity for solving linear tridiagonal systems on cube architectures. In Hypercubes 1987, 1987.

  13. S. Lakshmivarahan and S. D. Dhall. Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems. McGraw-Hill, 1990.

  14. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufmann, 1992.

  15. D. Lenoski et al. The Stanford Dash multiprocessor. IEEE Computer, 25(3):63–79, 1992.

    Google Scholar 

  16. G. M. Papadopoulos and D. E. Culler. Monsoon: An explicit token-store architecture. In Proc. of the 17th Annual Int. Symp. on Comp. Arch. Seattle, Washington, May 1990.

  17. E. E. Santos. Optimal and efficient parallel algorithms for summing and prefix summing. Journal of Parallel and Distributed Computing, 64(2):2002.

  18. E. E. Santos. Optimal parallel algorithms for solving tridiagonal linear systems. In Springer-Verlag Lecture Notes in Computer Science #1300 Proceedings of EURO-PAR97, 1997.

  19. E. E. Santos. Optimal and near-optimal algorithms for k-item broadcast. Journal of Parallel and Distributed Computing, 57(2):1999.

  20. E. E. Santos. Tridiagonal solvers on k-dimensional mesh and torus networks. Proc. of International Conf. on Parallel and Distributed Processing Techniques and Applications, 2000.

  21. E. E. Santos. Tridiagonal solvers with multiple right-hand sides on k-dimensional mesh and torus networks. Parallel Processing Letters, 13(4):2003.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Virginia Polytechnic Institute & State University, USA

    Eunice E. Santos

Authors
  1. Eunice E. Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Santos, E.E. Optimal and Efficient Parallel Tridiagonal Solvers Using Direct Methods. The Journal of Supercomputing 30, 97–115 (2004). https://doi.org/10.1023/B:SUPE.0000040615.60545.c6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SUPE.0000040615.60545.c6

Search

Navigation