TY - JOUR
T1 - FAMe-TM
T2 - Formal analysis methodology for task migration algorithms in Many-Core systems
AU - Bukhari, Syed Ali Asadullah
AU - Lodhi, Faiq Khalid
AU - Hasan, Osman
AU - Shafique, Muhammad
AU - Henkel, Jörg
N1 - Funding Information:
This work is supported in parts by the German Research Foundation (DFG) as part of the priority program “Dependable Embedded Systems” ( SPP 1500 – spp1500.itec.kit.edu ) and in parts by the DAAD “Deutsch-Pakistanische Forschungskooperationen” project.
Publisher Copyright:
© 2016 Elsevier B.V.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - Distributed Dynamic Thermal Management (dDTM) through task migrations across cores provides a very promising solution to cater for the heating issues in Many-Core architectures. However, the growing number of cores, the distributed nature of dDTM and the inherent sampling-based nature of traditional analysis techniques, like simulation and emulation, makes a complete and rigorous analysis of these task migration algorithms almost impossible. These limitations compromise the analysis integrity and in worst cases may lead to the deployment of an inefficient and inaccurate dDTM scheme on chip, which in turn can cause permanent defects in the chip due to excessive heating. Leveraging upon the exhaustive nature of model checking based verification, we propose to use a model checker to formally verify task migration algorithms. This work proposes an analysis methodology, i.e., Formal Analysis Methodology for Task Migrations (FAMe-TM), and identifies a generic set of properties for the formal verification of task-migration-based dDTM schemes. In particular, we propose an analysis flow using the scalable bounded model checker, nuXmv, to formally verify the suggested task migration properties, like tasks migrations, stalls, completion, creation of hot spots, time spent in migration and time to achieve stability. For illustration purposes, we apply FAMe-TM to two recently proposed task-migration-based dDTM schemes, i.e., Thermal Coupling Aware (TCA-TM) dDTM and Hot Spot Reduction (HR-TM) dDTM.
AB - Distributed Dynamic Thermal Management (dDTM) through task migrations across cores provides a very promising solution to cater for the heating issues in Many-Core architectures. However, the growing number of cores, the distributed nature of dDTM and the inherent sampling-based nature of traditional analysis techniques, like simulation and emulation, makes a complete and rigorous analysis of these task migration algorithms almost impossible. These limitations compromise the analysis integrity and in worst cases may lead to the deployment of an inefficient and inaccurate dDTM scheme on chip, which in turn can cause permanent defects in the chip due to excessive heating. Leveraging upon the exhaustive nature of model checking based verification, we propose to use a model checker to formally verify task migration algorithms. This work proposes an analysis methodology, i.e., Formal Analysis Methodology for Task Migrations (FAMe-TM), and identifies a generic set of properties for the formal verification of task-migration-based dDTM schemes. In particular, we propose an analysis flow using the scalable bounded model checker, nuXmv, to formally verify the suggested task migration properties, like tasks migrations, stalls, completion, creation of hot spots, time spent in migration and time to achieve stability. For illustration purposes, we apply FAMe-TM to two recently proposed task-migration-based dDTM schemes, i.e., Thermal Coupling Aware (TCA-TM) dDTM and Hot Spot Reduction (HR-TM) dDTM.
KW - Dynamic Thermal Management
KW - Formal verification
KW - Many-Core systems
KW - Model checking
KW - nuXmv
UR - http://www.scopus.com/inward/record.url?scp=84997108104&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84997108104&partnerID=8YFLogxK
U2 - 10.1016/j.scico.2016.06.004
DO - 10.1016/j.scico.2016.06.004
M3 - Article
AN - SCOPUS:84997108104
SN - 0167-6423
VL - 133
SP - 154
EP - 174
JO - Science of Computer Programming
JF - Science of Computer Programming
ER -