Scalable parallel linear solver for compact banded systems on heterogeneous architectures
نویسندگان
چکیده
A scalable algorithm for solving compact banded linear systems on distributed memory architectures is presented. The proposed method factorizes the original system into two levels of hierarchies, and solves it using parallel cyclic reduction both shared memory. This has a lower communication footprint across partitions compared to conventional algorithms involving data transposes or re-partitioning. developed in this work generalized with flexible decompositions. For systems, direct solver deterministic operation counts depending matrix size, its bandwidth, partition strategy. implementation runtime configuration details are discussed performance optimization. Scalability demonstrated as well representative fluid mechanics application problem, which dominant computational cost tridiagonal numerical schemes 3D periodic domain. particularly useful arising from finite difference operators wide range partial differential equation problems, such but not limited simulations compressible turbulent flows, aeroacoustics, elastic–plastic wave propagation, electromagnetics. It alleviates obstacles their use modern high computing hardware, where power nodes multi-threaded processing units.
منابع مشابه
On Experiments with a Parallel Direct Solver for Diagonally Dominant Banded Linear Systems
We report on numerical experiments that we conducted with a direct algorithm, the single width sparator algorithm, to solve diagonally dominant banded linear systems. With detailed estimations of computation and communication cost we quantitatively analyze their innuence on the parallel performance of the algorithm. We report on numerical experiments executed on an Intel Paragon XP/S-22MP.
متن کاملDirect Parallel Algorithms for Banded Linear Systems
We investigate direct algorithms to solve linear banded systems of equations on MIMD multiprocessor computers with distributed memory. We show that it is hard to beat ordinary one-processor Gaussian elimination. Numerical computation results from the Intel Paragon are given.
متن کاملParallel Logic Programming Systems on Scalable Architectures
Parallel logic programming (PLP) systems are sophisticated examples of symbolic computing systems. They address problems such as dynamic memory allocation, scheduling irregular execution patterns, and managing diierent types of implicit parallelism. Most PLP systems have been developed for bus-based shared-memory architectures. The complexity of PLP systems and the large amount of data they pro...
متن کاملScalable Stable Solvers for Non-symmetric Narrow-Banded Linear Systems
Banded linear systems with large bandwidths can be solved by similar methods as full linear systems. In particular, parallel algorithms based on torus-wrap mapping and Gaussian elimination with partial pivoting have been used with success. These algorithms are not suitable, however , if the bandwidth is small, say, between 1 and 100. As the bandwidth limits the amount of parallelism available a...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2022
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2022.111443