Energy-Efficient Scheduling of Periodic Applications on Safety-Critical Time-Triggered Multiprocessor Systems

Jiang, Xiaowen; Huang, Kai; Zhang, Xiaomeng; Yan, Rong; Wang, Ke; Xiong, Dongliang; Yan, Xiao

doi:10.3390/electronics7060098

Cited by 4 publications

(3 citation statements)

References 45 publications

(92 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chen et al 11 analyzed the sensitivity of the timing parameters of tasks with strict periods in multi-core real-time systems. Jiang et al 27 addressed the scheduling of strictly and nonstrictly periodicity real-time tasks by including the energy optimization.…”

Section: Related Workmentioning

confidence: 99%

Strictly periodic first: An optimal variant of LLF for scheduling tasks in a time‐critical cyber‐physical system

Kermia¹

2020

Concurrency and Computation

View full text Add to dashboard Cite

Cyber-physical systems (CPSs) include time-critical embedded systems where strict timing constraints are considered. These specific CPSs are dealing with close loop control functions, they are interfacing to sensors and actuators and have to fulfill safety critical real-time constraints. To guarantee the timing correctness, a lot of work introduced the strict-periodicity constraint. The latter is of great importance since it concerns sensors/actuators periodic tasks for which the relevancy of information they use is linked to the accuracy of their repetition. Applied to real-time control systems, the strict-periodicity constraint ensures much more stability and robustness. Therefore, the problem of scheduling real-time strictly periodic tasks has been targeted by several works in the literature but all these works were interested in nonpreemptive systems. In this work, we consider as strictly periodic and nonpreemptive only the sensory subtask and the remaining portion of the task may be preempted. This way, input transaction of every task receives the highest priority when accessing processor resource which enhances system predictability. On the other hand, the preemption allows easing schedulability analysis and, most of the time, it leads to a better processor utilization. The article proposes an optimal such task scheduling algorithm, called SPF for Strictly Periodic First, based on the Least Laxity First (LLF) scheduler and an efficient schedulability analysis. Simulation experiments with randomly generated task sets allowed showing the effectiveness of the proposed approach.

show abstract

Section: Related Workmentioning

confidence: 99%

Strictly periodic first: An optimal variant of LLF for scheduling tasks in a time‐critical cyber‐physical system

Kermia¹

2020

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…In [23], authors propose static scheduling for multiple periodic applications consisting of strictly and non-strictly periodic tasks on time-critical completion time. It is an interesting job because the solution is based on an improved Mixed Integer Linear Programming (MILP) method in order to obtain an optimal scheduling solution.…”

Section: Related Workmentioning

confidence: 99%

Performance-Aware Scheduling of Parallel Applications on Non-Dedicated Clusters

2019

View full text Add to dashboard Cite

This work presents a HPC framework that provides new strategies for resource management and job scheduling, based on executing different applications in shared compute nodes, maximizing platform utilization. The framework includes a scalable monitoring tool that is able to analyze the platform’s compute node utilization. We also introduce an extension of CLARISSE, a middleware for data-staging coordination and control on large-scale HPC platforms that uses the information provided by the monitor in combination with application-level analysis to detect performance degradation in the running applications. This degradation, caused by the fact that the applications share the compute nodes and may compete for their resources, is avoided by means of dynamic application migration. A description of the architecture, as well as a practical evaluation of the proposal, shows significant performance improvements up to 20% in the makespan and 10% in energy consumption compared to a non-optimized execution.

show abstract

“…Scheduling for energy efficiency and effective real-time response of embedded systems is addressed in Reference [15], which propose static scheduling methods based on mixed integer linear programming and heuristics, for both periodic and non-periodic tasks.…”

Section: The Present Issuementioning

confidence: 99%