Welcome to the InfoSci Platform
A Study of Sparse Matrix Methods on New Hardware: Advances and Challenges

A Study of Sparse Matrix Methods on New Hardware: Advances and Challenges

Athanasios Fevgas, Konstantis Daloukas, Panagiota Tsompanopoulou, Panayiotis Bozanis
Copyright: © 2015 |Volume: 3 |Issue: 3 |Pages: 19
ISSN: 2166-7241|EISSN: 2166-725X|EISBN13: 9781466680579|DOI: 10.4018/IJMSTR.2015070101
Cite Article Cite Article

MLA

Fevgas, Athanasios, et al. "A Study of Sparse Matrix Methods on New Hardware: Advances and Challenges." IJMSTR vol.3, no.3 2015: pp.1-19. http://doi.org/10.4018/IJMSTR.2015070101

APA

Fevgas, A., Daloukas, K., Tsompanopoulou, P., & Bozanis, P. (2015). A Study of Sparse Matrix Methods on New Hardware: Advances and Challenges. International Journal of Monitoring and Surveillance Technologies Research (IJMSTR), 3(3), 1-19. http://doi.org/10.4018/IJMSTR.2015070101

Chicago

Fevgas, Athanasios, et al. "A Study of Sparse Matrix Methods on New Hardware: Advances and Challenges," International Journal of Monitoring and Surveillance Technologies Research (IJMSTR) 3, no.3: 1-19. http://doi.org/10.4018/IJMSTR.2015070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Modeling of numerous scientific and engineering problems, such as multi-physic problems and analysis of electrical power systems, amounts to the solution of large scale linear systems. The main characteristics of such systems are the large sparsity ratio and the large number of unknowns that can reach thousands or even millions of equations. As a result, efficient solution of sparse large-scale linear systems is of great importance in order to enable analysis of such problems. Direct and iterative algorithms are the prevalent methods for solution of linear systems. Advances in computer hardware provide new challenges and capabilities for sparse solvers. The authors present a comprehensive evaluation of some, state of the art, sparse methods (direct and iterative) using modern computing platforms, aiming to determine the performance boundaries of each solver on different hardware infrastructures. By identifying the potential performance bottlenecks of out-of-core direct methods, the authors present a series of optimizations that increase their efficiency on flash-based systems.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.