PSPIKE : A Parallel Hybrid Sparse Linear System Solver

2008-08-28
Manguoğlu, Murat
Schenk, Olaf
Show full item record
53
views
0
downloads
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, we present a new parallel solver that combines the desirable characteristics of direct methods (robustness) and effective iterative solvers (low computational cost), while alleviating their drawbacks (memory requirements, lack of robustness). Our proposed hybrid solver is based on the general sparse solver PARDISO, and the "Spike" family of hybrid solvers. The resulting algorithm, called PSPIKE, is as robust as direct solvers, more reliable than classical preconditioned Krylov subspace methods, and much more scalable than direct sparse solvers. We support our performance and parallel scalability claims using detailed experimental studies and comparison with direct solvers, as well as classical preconditioned Krylov methods.
Tridiagonal systems, Cyclic reduction, Graphics processing unit, Direct solvers, Hybrid solvers, Krylov subspace methods, Sparse linear systems
https://hdl.handle.net/11511/74179
https://user.ceng.metu.edu.tr/~manguoglu/PDFs/1569183598.pdf
15th International Euro-Par Conference (25-28 August 2009)
Department of Computer Engineering, Conference / Seminar

Suggestions

Performance Models for the Spike Banded Linear System Solver
Manguoğlu, Murat; Sameh, Ahmed; Grama, Ananth (Hindawi Limited, 2011)
With availability of large-scale parallel platforms comprised of tens-of-thousands of processors and beyond, there is significant impetus for the development of scalable parallel sparse linear system solvers and preconditioners. An integral part of this design process is the development of performance models capable of predicting performance and providing accurate cost models for the solvers and preconditioners. There has been some work in the past on characterizing performance of the iterative solvers them...
Safran: a distributed and parallel application development frameworks of hetereogeneous workstations
Gölyeri, Hamza; Bozyiğit, Müslim; Department of Computer Engineering (2005)
With the rapid advances in high-speed network technologies and steady decrease in the cost of hardware involved, network of workstation (NOW) environments began to attract attention as competitors against special purpose, high performance parallel processing environments. NOWs attract attention as parallel and distributed computing environments because they provide high scalability in terms of computing capacity and they have much smaller cost/performance ratios with high availability. However, they are har...
Performance benchmarking of a discontinuous Galerkin-based compressible flow solver on GPU computing platforms using cnsBench
Karakuş, Ali; Unnikrishnan, Umesh; Rowe, Kris; Patel, Saumil S (2022-11-22)
Heterogeneous computing architectures have become an integral feature of modern supercomputers. In this work, we present the performance benchmarking results of a discontinuous Galerkin, spectral-element solver for the compressible Navier-Stokes equations on different GPU-based computing platforms. The solver uses OCCA, an open-source library that provides the portability layer to offload targeted kernels across different architectures and vendor platforms, and achieve application portability. Profiling of ...
Phaneros: Visibility-based framework for massive peer-to-peer virtual environments
Cevikbas, Safak Burak; İşler, Veysi (Wiley, 2019-01-01)
Contemporary distributed virtual environments are growing out of terabytes of 3D content and hundreds of thousands of users. Server-client architectures have become inadequate for fulfilling the scalability requirements. The peer-to-peer architectures provide inherently scalable, cost-effective distributed solutions for distributed virtual environments. We present a fully distributed peer-to-peer framework, Phaneros, which is capable of providing necessary means to realize more efficient and more scalable m...
Boostıng performance of hls optımızatıon for soc based hardware accelerators.
Kocaay, Aziz Berkin; Bazlamaçcı, Cüneyt F..; Department of Electrical and Electronics Engineering (2020)
Modern large-scale computing algorithms require huge amount of computational power. In adapting to increasing computation demands, FPGA-based SoC platforms provide an alternative to traditional CPU or GPU units, which suffer from thermal problems, power issues, etc. However, design flow for FPGA based development may be hard and time-consuming for an average software engineer who has limited knowledge about hardware design. A new approach in FPGA-based system development without the need for a hardware engi...
Citation Formats
M. Manguoğlu and O. Schenk, “PSPIKE : A Parallel Hybrid Sparse Linear System Solver,” Netherlands, 2008, vol. 5704, p. 797, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/74179.
METU IIS - Integrated Information Service open@metu.edu.tr