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

Authors:
M. Marqués;G. Quintana-Ortí;E. S. Quintana-Ortí;R. Geijn
Affiliations:
Depto. de Ingeniería y Ciencia de Computadores, Universidad Jaime I, Castellón, Spain 12.071;Depto. de Ingeniería y Ciencia de Computadores, Universidad Jaime I, Castellón, Spain 12.071;Depto. de Ingeniería y Ciencia de Computadores, Universidad Jaime I, Castellón, Spain 12.071;Dept. of Computer Sciences, The University of Texas at Austin, Austin, USA 78712
Venue:
The Journal of Supercomputing
Year:
2011

Citing 8
Cited 0

Parallel Out-of-Core Cholesky and QR Factorization with POOCLAPACK

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Parallel out-of-core computation and updating of the QR factorization

ACM Transactions on Mathematical Software (TOMS)
Computational methods and processing strategies for estimating earth's gravity field

Computational methods and processing strategies for estimating earth's gravity field
Updating an LU Factorization with Pivoting

ACM Transactions on Mathematical Software (TOMS)
Programming matrix algorithms-by-blocks for thread-level parallelism

ACM Transactions on Mathematical Software (TOMS)
Solving "large dense matrix problems on multi-core processors

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Out-of-Core Computation of the QR Factorization on Multi-core Processors

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Rapid development of high-performance out-of-core solvers

PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

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.