For real-time computing systems, energy efficiency,
Quality of Service, and fault tolerance are among the major design
concerns. In this work, we study the problem of reliable and
energy-aware fixed-priority (m,k)-deadlines enforcement with
standby-sparing. The standby-sparing systems adopt a primary
processor and a spare processor to provide fault tolerance
for both permanent and transient faults. In order to reduce
energy consumption for such kind of systems, we proposed a
novel scheduling scheme under the QoS constraint of (m,k)-
deadlines. The evaluation results demonstrate that our proposed
approach significantly outperformed the previous research in
energy conservation while assuring (m,k)-deadlines and fault
tolerance for real-time systems.
more »
« less
Fault-Tolerant Energy Management for Real-Time Systems with Weakly Hard QoS Assurance
While energy consumption is the primary concern
for the design of real-time embedded systems, fault-tolerance and
quality of service (QoS) are becoming increasingly important in
the development of today’s pervasive computing systems. In this
work, we study the problem of energy-aware standby-sparing for
weakly hard real-time embedded systems. The standby-sparing
systems adopt a primary processor and a spare processor to
provide fault tolerance for both permanent and transient faults.
In order to reduce energy consumption for such kind of systems,
we proposed two novel scheduling schemes: one for (1,1)-hard
tasks and one for general (m,k)-hard tasks which require that
at least m out of any k consecutive jobs of a task meet their
deadlines. Through extensive evaluations, our results demonstrate
that the proposed techniques significantly outperform the previous
research in reducing energy consumption for both (1,1)-hard
task sets and general (m,k)-hard task sets while assuring fault
tolerance through standby-sparing.
more »
« less
- Award ID(s):
- 2135345
- NSF-PAR ID:
- 10333717
- Date Published:
- Journal Name:
- 2021 IEEE International Conference on Computer Communications
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
For real-time computing systems, energy efficiency, Quality of Service, and fault tolerance are among the major design concerns. In this work, we study the problem of reliable and energy-aware fixed-priority (m,k)-deadlines enforcement with standby-sparing. The standby-sparing systems adopt a primary processor and a spare processor to provide fault tolerance for both permanent and transient faults. In order to reduce energy consumption for such kind of systems, we proposed a novel scheduling scheme under the QoS constraint of (m,k)- deadlines. The evaluation results demonstrate that our proposed approach significantly outperformed the previous research in energy conservation while assuring (m,k)-deadlines and fault tolerance for real-time systems.more » « less
-
For real-time computing systems, energy efficiency and reliability are two primary design concerns. In this research work, we study the problem of enhanced energy-aware standbysparing for fixed-priority (FP) hard real-time systems under reliability requirement. The standby-sparing system adopts a primary processor and a spare processor to provide fault tolerance for both permanent and transient faults. In order to keep the energy consumption for such kind of systems under control, we explore enhanced fixed-priority scheduling schemes to minimize the overlapped concurrent executions of the workloads on the primary processor and on the spare processor, enabling energy savings. Moreover, efficient online scheduling techniques are under development to boost the energy savings during runtime while preserving the system reliability.more » « less
-
Both energy-efficiency and real-time performance are critical requirements in many embedded systems applications such as self-driving car, robotic system, disaster response, and security/safety control. These systems entail a myriad of real-time tasks, where each task itself is a parallel task that can utilize multiple computing units at the same time. Driven by the increasing demand for parallel tasks, multi-core embedded processors are inevitably evolving to many-core. Existing work on real-time parallel tasks mostly focused on real-time scheduling without addressing energy consumption. In this paper, we address hard real-time scheduling of parallel tasks while minimizing their CPU energy consumption on multicore embedded systems. Each task is represented as a directed acyclic graph (DAG) with nodes indicating different threads of execution and edges indicating their dependencies. Our technique is to determine the execution speeds of the nodes of the DAGs to minimize the overall energy consumption while meeting all task deadlines. It incorporates a frequency optimization engine and the dynamic voltage and frequency scaling (DVFS) scheme into the classical real-time scheduling policies (both federated and global) and makes them energy-aware. The contributions of this paper thus include the first energy-aware online federated scheduling and also the first energy-aware global scheduling of DAGs. Evaluation using synthetic workload through simulation shows that our energy-aware real-time scheduling policies can achieve up to 68% energy-saving compared to classical (energy-unaware) policies. We have also performed a proof of concept system evaluation using physical hardware demonstrating the energy efficiency through our proposed approach.more » « less
-
more » « less
The increasing computing demands of autonomous driving applications have driven the adoption of multicore processors in real-time systems, which in turn renders energy optimizations critical for reducing battery capacity and vehicle weight. A typical energy optimization method targeting traditional real-time systems finds a critical speed under a static deadline, resulting in conservative energy savings that are unable to exploit dynamic changes in the system and environment. We capture emerging dynamic deadlines arising from the vehicle’s change in velocity and driving context for an additional energy optimization opportunity. In this article, we extend the preliminary work for uniprocessors [
66 ] to multicore processors, which introduces several challenges. We use the state-of-the-art real-time gang scheduling [5 ] to mitigate some of the challenges. However, it entails an NP-hard combinatorial problem in that tasks need to be grouped into gangs of tasks, gang formation, which could significantly affect the energy saving result. As such, we present EASYR, an adaptive system optimization and reconfiguration approach that generates gangs of tasks from a given directed acyclic graph for multicore processors and dynamically adapts the scheduling parameters and processor speeds to satisfy dynamic deadlines while consuming as little energy as possible. The timing constraints are also satisfied between system reconfigurations through our proposed safe mode change protocol. Our extensive experiments with randomly generated task graphs show that our gang formation heuristic performs 32% better than the state-of-the-art one. Using an autonomous driving task set from Bosch and real-world driving data, our experiments show that EASYR achieves energy reductions of up to 30.3% on average in typical driving scenarios compared with a conventional energy optimization method with the current state-of-the-art gang formation heuristic in real-time systems, demonstrating great potential for dynamic energy optimization gains by exploiting dynamic deadlines.
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
