Revisiting conventional task schedulers to exploit asymmetry in multi-core architectures for dense linear algebra operations

摘要

Dealing with asymmetry in the architecture opens a plethora of questions related with the performance-and energy-efficient scheduling of task-parallel applications. While there exist early attempts to tackle this problem, for example via ad-hoc strategies embedded in a runtime framework, in this paper we take a different path, which consists in addressing the asymmetry at the library-level by developing a few asymmetry-aware fundamental kernels. The appealing consequence is that the architecture heterogeneity remains then hidden from the task scheduler.