Strictly periodic scheduling in IMA-based architectures

Sheikh, Ahmad Al; Brun, Olivier; Hladik, Pierre-Emmanuel; Prabhu, Balakrishna

doi:10.1007/s11241-012-9148-y

Cited by 40 publications

(53 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These results are similar to formulas used in Al Sheikh et al (2012) for latency and in Pontisso et al (2010) for consistency. However, we specialise these local approaches to our model.…”

Section: Local Vs Global Analysissupporting

confidence: 85%

“…For instance, the authors of Sagaspe and Bieber (2007) propose an automatic method based on integer linear programming (ILP) for allocating functional specifications on a platform while ensuring some safety (i.e., fault-tolerance) requirements. In Al Sheikh et al (2012), the authors also propose a technique based on mixed ILP to automatically allocate and schedule avionics functions on an IMA platform. Their objective is the maximisation of the spare resource on each module in order to meet future resource demand growth.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

End-to-end latency and temporal consistency analysis in networked real-time systems

Lauer

Boniol

Pagetti

2014

IJCCBS

View full text Add to dashboard Cite

. End-to-end latency and temporal consistency analysis in networked real-time systems. International Journal of Critical ComputerBased Systems, Inderscience, 2014, vol. 5 (n°3/4), pp. 172-196 Abstract: Critical embedded systems are often designed as a set of real-time tasks, running on shared computing modules, and communicating through networks. Because of their critical nature, such systems have to meet strict timing properties. To help the designers to prove the correctness of their system, the real-time systems community has developed numerous approaches for analysing the worst case scenarios either on the processors (e.g., worst case response time of a task) or on the networks (e.g., worst case traversal time of a message). These approaches provide results only for local components behaviours. However, there is a growing need for having a global view of the system, in order to determine end-to-end properties. Such a property applies to functional chains which describe the behaviour of sequences of tasks. We propose an approach to analyse worst case behaviour along functional chains in critical embedded systems. It is based on mixed integer linear programming (MILP) and is general in the sense that it can be applied to a variety of end-to-end properties. This paper focuses on two essential properties: end-to-end latency and temporal consistency. This work was supported by the French National Research Agency within the SATRIMMAP project.Keywords: real-time systems; embedded systems; worst-case analysis; latency; temporal consistency; mixed integer linear programming; MILP.Reference to this paper should be made as follows: Lauer, M., Boniol, F., Pagetti, C. and Ermont, J. (2014) 'End-to-end latency and temporal consistency analysis in networked real-time systems', Int.

show abstract

“…These results are similar to formulas used in Al Sheikh et al (2012) for latency and in Pontisso et al (2010) for consistency. However, we specialise these local approaches to our model.…”

Section: Local Vs Global Analysissupporting

confidence: 85%

Section: Related Workmentioning

confidence: 99%

End-to-end latency and temporal consistency analysis in networked real-time systems

Lauer

Boniol

Pagetti

2014

IJCCBS

View full text Add to dashboard Cite

show abstract

“…To obtain more reproducible results, we have also forced the use of a single thread, both for the MILP and for the heuristic. Table 1 presents the results of our heuristic (in the integral case), the MILP formulation, and the original heuristic (Al Sheikh et al 2012), on 15 instances with N = 20 tasks and P = 4 processors. Columns 6-10 contain the results of our new version of the heuristic.…”

Section: Resultsmentioning

confidence: 99%

“…Because of its obvious analogy with game theory, where agents try to optimize their actions given the actions of other agents, the problem studied in this section is called the best response problem (Al Sheikh 2011;Al Sheikh et al 2012). In the following, we first present a method, called the best offset procedure, which allows to find the best location for a task on a given processor.…”

Section: Optimizing the Offset Of One Taskmentioning

confidence: 99%

“…In Al Sheikh et al (2012), the authors propose a method, which also works in the case of fractional offsets, consisting in computing the α i -values only for a set of precomputed intersection points (since a fractional optimum always lies at the intersection of an increasing and a decreasing line). Here, we present a much more efficient method which relies on the fact that (B O p i ) is locally a twodimensional linear program.…”

Section: Solving the Best Offset Problemmentioning

confidence: 99%

See 1 more Smart Citation

Line search method for solving a non-preemptive strictly periodic scheduling problem

Pira

Artigues

2014

J Sched

View full text Add to dashboard Cite

This paper is an extended version of the paper published In G. Kendall, G. Vanden Berghe, and B. McCollum, editors, 6 th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pages 356-371, Ghent, Belgium, 2013. ISSN: 2305-249XInternational audienceWe study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic field where a set of N periodic tasks (measure of a sensor, data presentation, etc.) has to be scheduled on P processors distributed on the plane. In this article, we consider an existing heuristic which is based on the notion of equilibrium. Following a game theory analogy, each task tries successively to optimize its own schedule and therefore to produce the best response, given the other schedules. We present a new method to compute the best response, and a propagation mechanism for non-overlapping constraints, which signi cantly improves this heuristic. These improvements allow the heuristic to compare favorably with MILP solutions

show abstract

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

Strictly periodic scheduling in IMA-based architectures

Cited by 40 publications

References 8 publications

End-to-end latency and temporal consistency analysis in networked real-time systems

End-to-end latency and temporal consistency analysis in networked real-time systems

Line search method for solving a non-preemptive strictly periodic scheduling problem

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

Contact Info

Product

Resources

About