The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Batched Computing
Abstract
This chapter presents the concept of batched computing, which consists of the division of a large problem into smaller portions and can be applied to both dense and sparse linear algebra. Two examples, general matrix-matrix multiplication (GEMM) and general triangular solver (GTSV), are used to present different approaches depending on the problem to solve. The GEMM example focuses on multi-core platforms, and it is also used to introduce the concept of auto-tunning. In the case of GTSV, the targeted device is a GPU. Moreover, given that this is a sparse operation, an analysis of the data layout is presented to see the impact of this aspect.
Related Content
.
© 2024.
45 pages.
|
.
© 2024.
48 pages.
|
.
© 2024.
66 pages.
|
.
© 2024.
57 pages.
|
.
© 2024.
39 pages.
|
.
© 2024.
40 pages.
|
.
© 2024.
99 pages.
|
|
|