Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Ghazal Ershadi

dblp:249/3422 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 35% Energy-efficient computing · 35% Distributed systems · 22%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Energy-efficient computing
energy-aware scheduling
0.822020
LESS-MICS: A Low Energy Standby-Sparing Scheme for Mixed-Criticality Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration · IEEE Trans. Parallel Distributed Syst. 2019
Embedded and real-time systems › real-time scheduling › mixed-criticality scheduling
mixed-criticality systems
0.412020
LESS-MICS: A Low Energy Standby-Sparing Scheme for Mixed-Criticality Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Energy-efficient computing › power management
dynamic voltage and frequency scaling
0.412019
On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration · IEEE Trans. Parallel Distributed Syst. 2019
Distributed systems
fault tolerance
0.412019
On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration · IEEE Trans. Parallel Distributed Syst. 2019
Embedded and real-time systems › real-time scheduling
mixed-criticality scheduling
0.412019
On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration · IEEE Trans. Parallel Distributed Syst. 2019
Embedded and real-time systems
real-time scheduling
0.412019
On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration · IEEE Trans. Parallel Distributed Syst. 2019
Distributed systems › replication
task replication
0.412019
On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration · IEEE Trans. Parallel Distributed Syst. 2019
Processor architecture and microarchitecture
chip multiprocessor
0.112019
On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration · IEEE Trans. Parallel Distributed Syst. 2019

Methods — techniques the papers use, named apart from their topics

parallelism and reduction policy · 0.4dynamic voltage and frequency scaling · 0.4dynamic power management · 0.4convex optimization · 0.4demand bound function · 0.4DVFS · 0.4
YearPublicationVenuePosition
2020 LESS-MICS: A Low Energy Standby-Sparing Scheme for Mixed-Criticality Systems
abstract
Multicore platforms are becoming the dominant trend in mixed-criticality systems (MCSs). Multicores provide great opportunities to realize task-level redundancy for reliability enhancement. However, they may experience limited utility in battery-powered mixed-criticality embedded systems. Hence, joint energy and reliability management is a crucial issue in designing MCSs. In this article, we propose the low energy standby-sparing mechanism in mixed-criticality system (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 management, and guarantying an acceptable service level for low-criticality tasks in overrun mode. To achieve further energy reduction, 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.
Sepideh Safari, Shaahin Hessabi, Ghazal Ershadi
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2019 On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration
abstract
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 management, fault-tolerance, and guaranteed service level in mixed-criticality multicore systems. In this paper, we exploit task-replication to not only satisfy reliability requirements, but also to improve the QoS of low-criticality tasks in overrun situation. Our proposed 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 execution 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 percent (24 percent on average) energy saving, and significantly improves the service levels of low-criticality tasks compared to the state-of-the-art schemes.
Sepideh Safari, Mohsen Ansari, Ghazal Ershadi, Shaahin Hessabi
IEEE Trans. Parallel Distributed Syst.3