|Title||CATA: Criticality Aware Task Acceleration for Multicore Processors|
|Publication Type||International Conferences|
|Year of Publication||2016|
|Authors||Castillo, E, Moreto, M, Casas, M, Alvarez, L, Vallejoz, E, Chronaki, K, Badia, R, Bosquez, JLuis, Beividez, R, Ayguadé, E, Labarta, J, Valero, M|
|Publisher||International Parallel and Distributed Parallel Symposium (IPDPS) 2016|
|Place Published||Chicago, USA|
Managing criticality in task-based programming models opens a wide range of performance and power optimization opportunities in future manycore systems. Criticality aware task schedulers can benefit from these opportunities by scheduling tasks to the most appropriate cores. However, these schedulers may suffer from priority inversion and static binding problems that limit their expected improvements.
Based on the observation that task criticality information can be exploited to drive hardware reconfigurations, we propose a Criticality Aware Task Acceleration (CATA) mechanism that dynamically adapts the computational power of a task depending on its criticality. As a result, CATA achieves significant improvements over a baseline static scheduler, reaching average improvements up to 18.4% in execution time and 30.1% in Energy-Delay Product (EDP) on a simulated 32-core system.
The cost of reconfiguring hardware by means of a software-only solution rises with the number of cores due to lock contention and reconfiguration overhead. Therefore, novel architectural support is proposed to eliminate these overheads on future manycore systems. This architectural support minimally extends hardware structures already present in current processors, which allows further improvements in performance with negligible overhead. As a consequence, average improvements of up to 20.4% in execution time and 34.0% in EDP are obtained, outperforming state-of-the-art acceleration proposals not aware of task criticality.