Skip to main content
SpringerLink
Log in

A two-way BSP algorithm for tridiagonal systems

  • Conference paper
  • First Online:
Book cover High-Performance Computing and Networking (HPCN-Europe 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1225))

Included in the following conference series:

  • 73 Accesses

Abstract

A two-way parallel recursive method is presented for solving a tridiagonal linear system. The algorithm is based on the parallel segment recursive method proposed in [9]. The computation and communication costs of the algorithm are analysed using the BSP (Bulk Synchronous Parallel) model.

This author was supported by KC Wong Scholarships and ORS Awards (No. 95032153).

This author was supported in part by EPSRC Research Grant GR/K16999.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.H. Bisseling and W.F. McColl, Scientific computing on bulk synchronous parallel architectures, Technical Report No. 836., Department of Mathematics, University of Utrecht”, Dec. 1993.

    Google Scholar 

  2. E. Dekker and L. Dekker, Parallel minimal norm method for tridiagonal linear systems, IEEE Trans. Computers., vol. 44, no. 7, pp. 942–946, 1995.

    Google Scholar 

  3. P. Dubois and G. Rodrigue, An analysis of the recursive doubling algorithm, in High Speed Computer and Algorithm Organization., Kuck et al., Eds. New York, Academic, 1977.

    Google Scholar 

  4. Ö. Eğecioğlu, C.K. Koc and A.J. Laub, A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors, J. Computat. Appl. Math., vol. 27, pp. 95–108, 1989.

    Google Scholar 

  5. G.H. Golub and C.F. Van Loan, Matrix Computations., Johns Hopkins University Press, Baltimore, MD, 1983.

    Google Scholar 

  6. J.M.D. Hill, P.I. Crumpton and D.A. Burgess, The theory, practice, and a tool for BSP performance prediction applied to a CFD application, Technical Report, No. 96/03 Oxford University Computing Lab. February, 1996.

    Google Scholar 

  7. R.W. Hockney, A fast direct solution of poisson's equation using Fourier analysis, J. ACM., 12 (1), pp. 95–113, 1965.

    Google Scholar 

  8. R.W. Hockney and C.R. Jesshope, Parallel Computers 2., Philadelphia, PA, Adam Hilger, 1988.

    Google Scholar 

  9. Y. Huang, Parallel recursive method for tridiagonal systems, Procs. 1997 Advances in Parallel and Distributed Computing., IEEE CS Press, March 19–21, 1997.

    Google Scholar 

  10. Y. Huang and W.F. McColl, Generalised Tridiagonal Matrix Inversion, 15th IMACS World Congress on Scientific Computation, Modeling and Applied Mathematics., Berlin, Aug 24–29, 1997. To appear.

    Google Scholar 

  11. P.M. Kogge and H.S. Stone, A parallel algorithm for efficient solution of a general class of recurrence equations, IEEE Trans. Computers., vol. 22, no. 8, pp.786–793, 1973.

    Google Scholar 

  12. W.F. McColl, Scalable parallel computing: A grand unified theory and its practical development, Procs. 13th IFIP World Computer Congress. (B. Pehrson and I.Simon, eds.), Vol. 1 (Invited Paper), Elsevier, pp. 539–546, 1994.

    Google Scholar 

  13. W.F. McColl, BSP Programming, in Specification of Parallel Algorithms. (G.E. Blelloch, K.M. Chandy and S. Jagannathan eds.), Procs. DIMACS Workshop, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 18, pp. 21–35, 1994.

    Google Scholar 

  14. W.F. McColl, Scalable Computing, in Computer Science Today: Recent Trends and Developments. (J. Van Leeuwen ed.), LNCS Volume 1000, Springer-Verlag, pp. 46–61, 1995.

    Google Scholar 

  15. H.S. Stone, An efficient parallel algorithm for the solution of a tridiagonal linear system of equations, J. Assoc. Compu. Mach., 20 (1), pp. 27–38, 1973.

    Google Scholar 

  16. H.S. Stone, Parallel tridiagonal equation solvers, ACM Trans. Math. Software., 1 (4), pp. 289–307, 1975.

    Google Scholar 

  17. H.A. Van der Vorst, Large tridiagonal and block tridiagonal linear systems on vector and parallel computers, Parallel Computing., 5, pp. 45–54, 1987.

    Google Scholar 

  18. L. Valiant, A bridging model for parallel computation, Communications of the ACM., vol. 33, no. 8, Aug. 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, Oxford University Computing Laboratory, Wolfson Building, OX1 3QD, Oxford, UK

    Yuguang Huang & W. F. McColl

Authors
  1. Yuguang Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. F. McColl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bob Hertzberger Peter Sloot

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, Y., McColl, W.F. (1997). A two-way BSP algorithm for tridiagonal systems. In: Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1997. Lecture Notes in Computer Science, vol 1225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031604

Download citation

  • DOI: https://doi.org/10.1007/BFb0031604

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62898-9

  • Online ISBN: 978-3-540-69041-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation