Skip to main content
SpringerLink
Log in

Using desktop computers to solve large-scale dense linear algebra problems

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

Abstract

We provide experimental evidence that current desktop computers feature enough computational power to solve large-scale dense linear algebra problems. While the high computational cost of the numerical methods for solving these problems can be tackled by the multiple cores of current processors, we propose to use the disk to store the large data structures associated with these applications. Our results also show that the limited amount of RAM and the comparatively slow disk of the system pose no problem for the solution of very large dense linear systems and linear least-squares problems. Thus, current desktop computers are revealed as an appealing, cost-effective platform for research groups that have to deal with large dense linear algebra problems but have no direct access to large computing facilities.

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.

Similar content being viewed by others

References

  1. Baboulin M (2006) Solving large dense linear least squares problems on parallel distributed computers. application to the Earth’s gravity field computation. Ph.D. dissertation, INPT. TH/PA/06/22

  2. Geng P, Oden JT, van de Geijn R (1996) Massively parallel computation for acoustical scattering problems using boundary element methods. J Sound Vib 191(1):145–165

    Article  Google Scholar 

  3. Gunter BC (2004) Computational methods and processing strategies for estimating Earth’s gravity field. Ph.D. thesis, The University of Texas at Austin

  4. Gunter BC, van de Geijn RA (2005) Parallel out-of-core computation and updating the QR factorization. ACM Trans Math Softw 31(1):60–78. http://doi.acm.org/10.1145/1055531.1055534

    Article  MATH  Google Scholar 

  5. Gunter BC, Reiley WC, van de Geijn RA (2001) Parallel out-of-core Cholesky and QR factorizations with POOCLAPACK. In: Proceedings of the 15th international parallel and distributed processing symposium (IPDPS). IEEE Computer Society, Los Alamitos

    Google Scholar 

  6. Joffrain T, Quintana-Ortí ES, van de Geijn RA (2005) Rapid development of high-performance out-of-core solvers. In: Proceedings of PARA 2004. Lecture notes in computer science, vol 3732. Springer, Berlin, Heidelberg, pp 413–422

    Google Scholar 

  7. Marqués M, Quintana-Ortí G, Quintana-Ortí ES, van de Geijn R (2009) Out-of-core computation of the QR factorization on multi-core processors. In: Proceedings of Euro-Par 2009. Lecture notes in computer science, vol 5704. Springer, Berlin, Heidelberg, pp 809–820

    Chapter  Google Scholar 

  8. Marqués M, Quintana-Ortí G, Quintana-Ortí ES, van de Geijn R (2009) Solving “large” dense matrix problems on multi-core processors. In: 10th IEEE international workshop on parallel and distributed scientific and engineering computing—PDSEC’09. (CD–DROM), pp 1–8

  9. Quintana-Ortí ES, van de Geijn RA (2008) Updating an LU factorization with pivoting. ACM Trans Math Soft 35(2):11:1–11:16

    Article  Google Scholar 

  10. Quintana-Ortí G, Quintana-Ortí ES, van de Geijn R, Zee FV, Chan E (2009) Programming matrix algorithms-by-blocks for thread-level parallelism. ACM Trans Math Soft 36(3):14:1–14:26. Available at http://doi.acm.org/10.1145/1527286.1527288

    Article  Google Scholar 

  11. Schafer N, Serban R, Negrut D (2008) Implicit integration in molecular dynamics simulation. In: ASME international mechanical engineering congress & exposition, 2008 (IMECE2008-66438)

  12. Watkins DS (2002) Fundamentals of matrix computations, 2nd edn. Wiley, New York

    Book  MATH  Google Scholar 

  13. Zhang Y, Sarkar TK, van de Geijn RA, Taylor MC (2008) Parallel MoM using higher order basis function and PLAPACK in-core and out-of-core solvers for challenging EM simulations. In: IEEE AP-S & USNC/URSI symposium, 2008

Download references

Author information

Authors and Affiliations

  1. Depto. de Ingeniería y Ciencia de Computadores, Universidad Jaime I, 12.071, Castellón, Spain

    M. Marqués, G. Quintana-Ortí & E. S. Quintana-Ortí

  2. Dept. of Computer Sciences, The University of Texas at Austin, Austin, TX, 78712, USA

    R. van de Geijn

Authors
  1. M. Marqués
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Quintana-Ortí
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. S. Quintana-Ortí
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. van de Geijn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. S. Quintana-Ortí.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marqués, M., Quintana-Ortí, G., Quintana-Ortí, E.S. et al. Using desktop computers to solve large-scale dense linear algebra problems. J Supercomput 58, 145–150 (2011). https://doi.org/10.1007/s11227-010-0394-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0394-2

Keywords

Search

Navigation