An Efficient Test Method for Rate Monotonic Schedulability

Park, Moonju; Park, Heemin

doi:10.1109/tc.2012.296

Cited by 13 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By leveraging previous results by Park and Park [31], Pazzaglia et al [30] derived a near-exact sufficient schedulability test that supports a much more efficient implementation within optimization problems. This test consists in checking a subset Y i of the values in [0, D i ] for each task τ i ∈ Γ, where the set of points Y i is defined as follows [30]:…”

Section: A Schedulability Analysismentioning

confidence: 87%

Maximizing the Security Level of Real-Time Software While Preserving Temporal Constraints

et al. 2023

View full text Add to dashboard Cite

Embedded computing systems are becoming increasingly relevant in the Internet of Things (IoT) and edge computing domains, where they are often employed as the control entity of a cyber-physical system. When operating in such interconnected domains, a software system is susceptible to cyber-attacks from external agents, which can compromise the correct behavior of the system. In addition, the software executing in these systems is typically characterized by stringent timing constraints, which must be satisfied during system execution. Enabling software protections to enhance the security level of the embedded software comes at the cost of increasing the computation times of the tasks, introducing the risk of deadline misses that could also jeopardize the system behavior. This paper presents a methodology to optimize the security level of real-time software while preserving system-wide schedulability by leveraging timing analysis. The proposed approach is based on a mixed-integer linear programming (MILP) formulation that maximizes the security level of the tasks and integrates a response-time analysis technique to assess the schedulability of the system whenever additional protections are activated to shield the software against cyber-attacks targeting specific classes of vulnerabilities. An experimental evaluation is presented to assess the performance of the proposed approach on a representative set of tasks included in standard benchmarking suites for embedded software.

show abstract

Section: A Schedulability Analysismentioning

confidence: 87%

Maximizing the Security Level of Real-Time Software While Preserving Temporal Constraints

et al. 2023

View full text Add to dashboard Cite

show abstract

“…So, aiming at this kind of big, complex, high real-time and reliable safety, dynamic algorithm can improve network performance under some circumstances [8,9,10], but maybe the complexity of its algorithm could be hidden trouble of system safely running. In addition, it is impossible for all device to select dynamic algorithm, therefore, we select static algorithm, for example, Rate Monotonic(RM) is common algorithm amongst static algorithm [11,12].…”

Section: Static Scheduling Strategy Design Of Rail Vehicle Ncsmentioning

confidence: 99%

Analysis and Optimization of Rail Vehicles Networked Control System Based on Static Scheduling Algorithm

Zhu

Guo

2014

AMR

View full text Add to dashboard Cite

The system performance of rail vehicles NCS mainly depends on communication performance and control performance. Because of considerably limited availability of computing resources, real-time scheduling of shared resources is among the factors that greatly impact system performance. From a real-time control perspective, the problem of real-time scheduling in NCS is illustrated based on timing analysis of a typical NCS. Take the MVB of rail vehicle NCS for example, The theory and practice of synchronously static Rate Monotonic(RM)are introduced into rail vehicle NCS, with special focus on open-up scheduling and adaptive scheduling, which made communication simplified and reliable. At the same time, build objective function of system performance based on state space equation, wholly benefits optimized design of rail vehicle NCS, considering both communication performance and control performance.

show abstract

A Review of the Schedulability Tests and Optimal Design for Rate-Monotonic Scheduling

et al. 2021

View full text Add to dashboard Cite

An Efficient Test Method for Rate Monotonic Schedulability

Cited by 13 publications

References 20 publications

Maximizing the Security Level of Real-Time Software While Preserving Temporal Constraints

Maximizing the Security Level of Real-Time Software While Preserving Temporal Constraints

Analysis and Optimization of Rail Vehicles Networked Control System Based on Static Scheduling Algorithm

A Review of the Schedulability Tests and Optimal Design for Rate-Monotonic Scheduling

Contact Info

Product

Resources

About