Shaahin Hessabi

Prof. Shaahin Hessabi

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 May 2018 in Journal of Open Source Software
Verified
Journal Article
Open access
PDF file
SHSepand Haghighi
Sepand Haghighi
MJMasoomeh Jasemi
Masoomeh Jasemi
SHShaahin Hessabi
Shaahin Hessabi
AZAlireza Zolanvari
Alireza Zolanvari
In the field of machine learning and specifically for statistical classification a confusion matrix-also known as error matrix-is a specific table layout that allows visualization of the algorithm performance, and is mostly used in supervised learning. Each row of the matrix represents the instances in an actual class, while each column represents the instances in a predict class (or vice versa)(Powers 2011;

18 January 2022 in IEEE Access
Verified
Journal Article
Open access
SSSepideh Safari
Sepideh Safari
MAMohsen Ansari
Mohsen Ansari
HKHeba Khdr
Heba Khdr
PGPourya Gohari-Nazari
Pourya Gohari-Nazari
SKSina Yari Karin
Sina Yari Karin
JHJorg Henkel
Jorg Henkel
The relentless technology scaling has provided a significant increase in processor performance, but on the other hand, it has led to adverse impacts on system reliability. In particular, technology scaling increases the processor susceptibility to radiation-induced transient faults. Moreover, technology scaling with the discontinuation of Dennard scaling increases the power densities, thereby temperatures, on the chip. High temperature, in turn, accelerates transistor aging mechanisms, which may ultimately lead to permanent faults on the chip. To assure a reliable system operation, despite these potential reliability concerns, fault-tolerance techniques have emerged. Specifically, fault-tolerance techniques employ some kind of redundancies to satisfy specific reliability requirements. However, the integration of fault-tolerance techniques into real-time embedded systems complicates preserving timing constraints. As a remedy, many task mapping/scheduling policies have been proposed to consider the integration of fault-tolerance techniques and enforce both timing and reliability guarantees for real-time embedded systems. More advanced techniques aim additionally at minimizing power and energy while at the same time satisfying timing and reliability constraints. Recently, some scheduling techniques have started to tackle a new challenge, which is the temperature increase induced by employing fault-tolerance techniques. These emerging techniques aim at satisfying temperature constraints besides timing and reliability constraints. This paper provides an in-depth survey of the emerging research efforts that exploit fault-tolerance techniques while considering timing, power/energy, and temperature from the real-time embedded systems’ design perspective. In particular, the task mapping/scheduling policies for fault-tolerance real-time embedded systems are reviewed and classified according to their considered goals and constraints. Moreover, the employed fault-tolerance techniques, application models, and hardware models are considered as additional dimensions of the presented classification. Lastly, this survey gives deep insights into the main achievements and shortcomings of the existing approaches and highlights the most promising ones.

27 March 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SSSepideh Safari
Sepideh Safari
MAMohsen Ansari
Mohsen Ansari
GEGhazal Ershadi
Ghazal Ershadi
SHShaahin Hessabi
Shaahin Hessabi
Advancement of Cyber-Physical Systems has attracted attention to Mixed-Criticality Systems (MCSs), both in research and in industrial designs. As multicore platforms are becoming the dominant trend in MCSs, joint energy and reliability management is a crucial issue. In addition, providing guaranteed service level for low-criticality tasks in critical mode is of great importance. To address these problems, we propose "LETR-MC" scheme that simultaneously supports certification, energy man- agement, fault-tolerance, and guaranteed service level in mixed-criticality multicore systems. In this paper, we exploit task-repli- cation to not only satisfy reliability requirements, but also to improve the QoS of low-criticality tasks in overrun situation. Our pro- posed LETR-MC scheme determines the number of replicas, and reduces the execution time overlap between the primary tasks and replicas. Moreover, instead of ignoring low-criticality tasks or selectively executing them without any guaranteed service level in overrun mode, it mathematically explores the minimum achievable service guarantee for each low-criticality task in different execu- tion modes, i.e. normal, fault-occurrence, overrun and critical operation modes. We develop novel unified demand bound functions (DBF), along with a DVFS method based on the proposed DBF analysis. Our experimental results show that LETR-MC provides up to 59% (24% on average) energy saving, and significantly improves the service levels of low-criticality tasks compared to the state-of-the-art schemes.

28 February 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
SSSepideh Safari
Sepideh Safari
SHShaahin Hessabi
Shaahin Hessabi
GEGhazal Ershadi
Ghazal Ershadi
Multicore platforms are becoming the dominant trend in Mixed-Criticality Systems (MCSs). Multicores provide great opportunities to realize task-level redundancy for reliability en-hancement. However, they may experience limited utility in bat-tery-powered mixed-criticality embedded systems. Hence, joint energy and reliability management is a crucial issue in designing MCSs. In this paper, we propose the LESS-MICS scheme, which uses the inherent redundancy of multicores to apply the standby-sparing technique for fault-tolerance. Also, by using the inherent redundancy, the LESS-MICS scheme proposes the Parallelism and Reduction policy that can be applied to any graph traverse algorithm to enhance the schedulability of graph-based mixed-criticality tasks, as well as joint energy and reliability manage-ment, and guarantying an acceptable service level for low-criticality tasks in overrun mode. To achieve further energy re-duction, we minimize energy through convex optimization, and also propose energy management heuristics which use Dynamic Voltage and Frequency Scaling and Dynamic Power Management. We evaluated our scheme under various system configurations. Experiments show that our scheme provides, on average, 24.2% energy reduction compared to state-of-the-art techniques while preserving an acceptable QoS level.

27 October 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SSSepideh Safari
Sepideh Safari
HKHeba Khdr
Heba Khdr
PGPourya Gohari-Nazari
Pourya Gohari-Nazari
MAMohsen Ansari
Mohsen Ansari
SHShaahin Hessabi
Shaahin Hessabi
JHJorg Henkel
Jorg Henkel
Multicore platforms are becoming the dominant trend in designing Mixed-Criticality Systems (MCSs), which integrate applications of different levels of criticality into the same platform. A well-known MCS is the dual-criticality system that is composed of low-criticality and high-criticality tasks. The availability of multiple cores on a single chip provides opportunities to employ fault-tolerant techniques, such as N-Modular Redundancy (NMR), to ensure the reliability of MCSs. However, applying fault-tolerant techniques will increase the power consumption on the chip, and thereby on-chip temperatures might increase beyond safe limits. To prevent thermal emergencies, urgent countermeasures, like Dynamic Voltage and Frequency Scaling (DVFS) or Dynamic Power Management (DPM) will be triggered to cool down the chip. Such countermeasures, however, might not only lead to suspending low-criticality tasks, but also it might lead to violating timing constraints of high-criticality tasks. In order to prevent such severe scenarios, it is indispensable to consider a temperature constraint within the scheduling process of fault-tolerant MCSs. Therefore, this paper presents, for the first time, a thermal-aware scheduling scheme for fault-tolerant MCSs, named TherMa-MiCs. In particular, TherMa-MiCs, satisfies the temperature constraint jointly with the timing constraints of the high-criticality tasks, while attempting to maximize the QoS of low-criticality tasks under the predefined constraints. At the same time, a reliability target is satisfied by employing the well-known N-Modular Redundancy (NMR) fault-tolerant technique. Experimental results show that our proposed scheme meets the temperature and timing constraints, while at the same time, improving the QoS of low-criticality tasks, with an average of 44%.

5 July 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MAMohsen Ansari
Mohsen Ansari
SSSepideh Safari
Sepideh Safari
HKHeba Khdr
Heba Khdr
PGPourya Gohari-Nazari
Pourya Gohari-Nazari
JHJorg Henkel
Jorg Henkel
SHShaahin Hessabi
Shaahin Hessabi
Increasing the number of cores integrated on a single chip offers a great potential for the implementation of fault-tolerant techniques to achieve high reliability in real-time embedded systems. Checkpointing with rollback-recovery is a well-established technique to tolerate transient faults in multicore platforms. To consider the worst-case fault occurrence scenario, checkpointing technique requires to re-execute some parts of the tasks, and that might lead to simultaneous execution of task parts with high power consumptions, which eventually might result in a peak power increase beyond the thermal design power (TDP). Exceeding TDP can elevate on-chip temperatures beyond safe limits, and thereby triggering countermeasures that throttle down the voltage and frequency levels or power gate the cores. Such countermeasures might lead to violating task deadlines and degrading the system's reliability. To avoid such severe scenarios, it is inevitable to consider the impact of applying fault-tolerant techniques on the power consumption and prevent violating the power constraint of the chip, i.e., TDP. This paper presents for the first time, a peak-power-aware checkpointing (PPAC) technique that tolerates a given number of faults, k, while at the same time meets the power constraint in hard real-time embedded systems. To do this, our proposed technique (PPAC) adjusts the timing of the checkpoints, which have lower power consumption than the tasks to the execution time points that have power spikes beyond TDP. Moreover, PPAC exploits the available slack times on the cores to delay the execution of some tasks to avoid the remaining power spikes beyond TDP, which could not be mitigated by solely adjusting checkpoints. To evaluate our technique, we extend the state-of-the-art system-level simulator, gem5, with the state-of-the-art checkpointing module in Linux. Our experimental results show that our proposed technique is able to tolerate a given number of faults without exceeding the timing and power constraints in hard real-time embedded systems. The resulting peak power reduction achieved by our technique compared to state-of-the-art techniques is an average of 23%. Moreover, our technique employs the Dynamic Power Management (DPM) during the slack times resulting at runtime in the case of fault-free scenarios, which provides energy savings with an average of 17.28% and up to 61.1%.