The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Sparse Linear Algebra: Applying New Features to Traditional Paradigms
Abstract
This chapter shows several new programming strategies based on tasking to parallelize sparse linear algebra kernels. The reader will explore different approaches to improve the performance of these kernels thanks to a better workload distribution and comprehension of the data layout. This will be accomplished through the study of some of the most popular and widely used sparse operations, such as SpMV (sparse matrix vector multiplication), GTSV (triangular solve), or CG (conjugate gradient). Those strategies have been tested on multicore systems. Some of them equipped GPU devices, showcasing how to overcome the peculiarities of task-based parallelized kernels in the context of sparse linear algebra computations.
Related Content
.
© 2023.
25 pages.
|
.
© 2023.
21 pages.
|
.
© 2023.
47 pages.
|
.
© 2023.
44 pages.
|
.
© 2023.
23 pages.
|
.
© 2023.
26 pages.
|
.
© 2023.
41 pages.
|
|
|