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

Pira, Clément; Artigues, Christian

doi:10.1007/s10951-014-0389-6

Cited by 16 publications

(13 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The pseudo-code for this equilibrium-based heuristic is given in Algorithm 3. This heuristic converges and can reach one or more fixed points after a finite number of iterations (The proof of this property is similar to those proposed in Al-Sheikh et al [1] and Pira and Artigues [12]). …”

Section: Equilibrium-based Heuristicsupporting

confidence: 67%

See 1 more Smart Citation

Schedulability analysis for independent partitions in integrated modular avionics systems

Chen

2015

2015 IEEE International Conference on Progress in Informatics and Computing (PIC)

View full text Add to dashboard Cite

Recently the integrated modular avionics (IMA) architecture has been widely adopted by the avionics industry due to its strong partition mechanism. Although the IMA architecture can achieve effective cost reduction and reliability enhancement in the development of avionics systems, it results in a complex allocation and scheduling problem. In this paper, we analyze the schedulability of independent partitions and provide proper schedules for multi-core IMA systems. We first calculate the maximum scaling factor, by which the execution times of all partitions can be multiplied without violating the timing requirements of the systems. Then, we use the scaling factor obtained to determine whether all partitions are schedulable and produce a valid allocation for each partition. Finally, simulation experiments are conducted to show the efficiency and reliability of our approach in terms of time consumption and acceptance ratio.

show abstract

Section: Equilibrium-based Heuristicsupporting

confidence: 67%

“…As the authors did in Al-Sheikh et al [2] and in Pira and Artigues [12], we assume that τ i does not change its center or assignment if the best response procedure does not improve its current scaling factor. That is to say: if…”

Section: Equilibrium-based Heuristicmentioning

confidence: 99%

Schedulability analysis for independent partitions in integrated modular avionics systems

Chen

2015

2015 IEEE International Conference on Progress in Informatics and Computing (PIC)

View full text Add to dashboard Cite

show abstract

“…All partitions take turns to select their offsets and assignments such that their computation times can be scaled as much as possible. This kind of solution is called the best response solution, which was firstly introduced by Al Sheikh et al [1, 26], and also studied by Pira and Artigues [6, 22]. …”

Section: Best Response Algorithmmentioning

confidence: 99%

“…As the authors did in Al Sheikh et al [1] and in Pira and Artigues [22], we assume that τ i does not change its center or assignment if the best response procedure does not improve its current scaling factor. That is to say: if , and .…”

Section: Best Response Algorithmmentioning

confidence: 99%

“…Al Sheikh et al [1] calculated the critical scaling factor by a best-response algorithm, and used the value calculated to determine whether all partitions were schedulable on a limited number of processors. Pira and Artigues [22] did a similar work and gave a new heuristic to solve the problem with a propagation mechanism for non-overlapping constraints.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling Independent Partitions in Integrated Modular Avionics Systems

Chen

Han

2016

PLoS ONE

View full text Add to dashboard Cite

Recently the integrated modular avionics (IMA) architecture has been widely adopted by the avionics industry due to its strong partition mechanism. Although the IMA architecture can achieve effective cost reduction and reliability enhancement in the development of avionics systems, it results in a complex allocation and scheduling problem. All partitions in an IMA system should be integrated together according to a proper schedule such that their deadlines will be met even under the worst case situations. In order to help provide a proper scheduling table for all partitions in IMA systems, we study the schedulability of independent partitions on a multiprocessor platform in this paper. We firstly present an exact formulation to calculate the maximum scaling factor and determine whether all partitions are schedulable on a limited number of processors. Then with a Game Theory analogy, we design an approximation algorithm to solve the scheduling problem of partitions, by allowing each partition to optimize its own schedule according to the allocations of the others. Finally, simulation experiments are conducted to show the efficiency and reliability of the approach proposed in terms of time consumption and acceptance ratio.

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

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

Cited by 16 publications

References 11 publications

Schedulability analysis for independent partitions in integrated modular avionics systems

Schedulability analysis for independent partitions in integrated modular avionics systems

Scheduling Independent Partitions in Integrated Modular Avionics Systems

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

Contact Info

Product

Resources

About