Skip to main content
SpringerLink
Log in

Neville elimination on multi- and many-core systems: OpenMP, MPI and CUDA

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

Abstract

This paper describes several parallel algorithmic variations of the Neville elimination. This elimination solves a system of linear equations making zeros in a matrix column by adding to each row an adequate multiple of the preceding one. The parallel algorithms are run and compared on different multi- and many-core platforms using parallel programming techniques as MPI, OpenMP and CUDA.

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. Intel (2005) Intel multi-core processor architecture developer backgrounder. White paper

  2. Owens JD, Houston M, Luebke D, Green S, Stone JE, Phillips JC (2008) GPU computing. Proc IEEE 96(5):879–899

    Article  Google Scholar 

  3. Gasca M, Peña JM (1992) Total positivity and Neville elimination. Linear Algebra Appl 165:25–44

    Article  MathSciNet  MATH  Google Scholar 

  4. Gasca M, Peña JM (1994) A matricial description of Neville elimination with applications to total positivity. Linear Algebra Appl 202:33–45

    Article  MathSciNet  MATH  Google Scholar 

  5. Demmel J, Koev P (2005) The accurate and efficient solution of a totally positive generalized Vandermonde linear system. SIAM J Matrix Anal Appl 27:142–152

    Article  MathSciNet  MATH  Google Scholar 

  6. Gemignani L (2008) Neville elimination for rank-structured matrices. Linear Algebra Appl 428(4):978–991

    Article  MathSciNet  MATH  Google Scholar 

  7. Alonso P, Cortina R, Díaz I, Ranilla J (2004) Neville elimination: a study of the efficiency using checkerboard partitioning. Linear Algebra Appl 393:3–14

    Article  MathSciNet  MATH  Google Scholar 

  8. Alonso P, Díaz I, Cortina R, Ranilla J (2008) Scalability of Neville elimination using checkerboard partitioning. Int J Comput Math 85(3–4):309–317

    Article  MathSciNet  MATH  Google Scholar 

  9. Alonso P, Cortina R, Díaz I, Ranilla J (2009) Blocking Neville elimination algorithm for exploiting cache memories. Appl Math Comput 209(1):2–9

    Article  MathSciNet  MATH  Google Scholar 

  10. Cortina R (2008) El método de Neville: un enfoque basado en Computación de Altas Prestaciones. Ph.D. thesis, Univ. of Oviedo, Spain

  11. Chandra R et al (2001) Parallel programming in OpenMP. Morgan Kaufmann, San Mateo

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Universidad de Oviedo, Oviedo, Spain

    P. Alonso

  2. Departamento de Informática, Universidad de Oviedo, Oviedo, Spain

    R. Cortina & J. Ranilla

  3. Departamento de Comunicaciones, Universidad Politécnica de Valencia, Valencia, Spain

    F. J. Martínez-Zaldívar

Authors
  1. P. Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Cortina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. J. Martínez-Zaldívar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Ranilla
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Ranilla.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alonso, P., Cortina, R., Martínez-Zaldívar, F.J. et al. Neville elimination on multi- and many-core systems: OpenMP, MPI and CUDA. J Supercomput 58, 215–225 (2011). https://doi.org/10.1007/s11227-009-0360-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-009-0360-z

Search

Navigation