.png){kind=icon}
.png){kind=icon}
Return
Experiences with nested parallelism in task-parallel applications using malleable BLAS on multicore processors
.png){kind=icon}
OA
AI
DOI：10.1177/10943420231157653.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Malleability is defined as the ability to vary the degree of parallelism at runtime, and is regarded as a means to improve core occupation on state-of-the-art multicore processors tshat contain tens of computational cores per socket. This property is especially interesting for applications consisting of irregular workloads and/or divergent executions paths. The integration of malleability in high-performance instances of the Basic Linear Algebra Subprograms (BLAS) is currently nonexistent, and, in consequence, applications relying on these computational kernels cannot benefit from this capability. In response to this scenario, in this paper we demonstrate that significant performance benefits can be gathered via the exploitation of malleability in a framework designed to implement portable and high-performance BLAS-like operations. For this purpose, we integrate malleability within the BLIS library, and provide an experimental evaluation of the result on three different practical use cases.
Keywords:
Malleability
basic linear algebra subprograms
high performance
multicore processors
Journal
IF:
2.5
Papers:
1.1K
Citations:
1.3K