An efficient approach for the multiprocessor non-preemptive strictly periodic task scheduling problem

Kermia, Omar

doi:10.1016/j.sysarc.2017.07.005

Cited by 7 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On one hand, fault-tolerant scheduling algorithms can be classified into two categories: preemptive scheduling [21]- [23] and non-preemptive scheduling [24]- [26]. In the preemptive scheduling method, the executing tasks can be preempted by other tasks.…”

Section: Related Workmentioning

confidence: 99%

“…In stark contrast, non-preemptive scheduling has the features of accurate response time analysis, ease of implementation, no synchronization overhead, and reduced stack memory requirements [26]. Non-preemptive scheduling has proven to be more beneficial than preemptive scheduling in many applications, such as multimedia applications [24].…”

Section: Related Workmentioning

confidence: 99%

“…The purpose of this paper is to maximize the QoS levels of all accepted tasks under time constraints, as shown in Equation (24). Where [49].…”

Section: Rc(x Pmentioning

confidence: 99%

See 2 more Smart Citations

QoS-Aware Task Placement With Fault-Tolerance in the Edge-Cloud

Sun

Fan

et al. 2020

IEEE Access

View full text Add to dashboard Cite

The geographically dispersed resources and ever-changing context incur unique heterogeneity, potential fragility, and vulnerability of an edge-cloud system. Thus, the reliability guarantee of services in the edge-cloud is critical. This paper firstly proposes a QoS-aware scheduling model with fault-tolerance in the edge-cloud, which extends the traditional primary-backup (PB) fault-tolerant model to improve the service reliability in the edge-cloud with the time constraints of tasks being satisfied. Then, a QoS-aware fault-tolerant scheduling algorithm including primary copy placement, backup copy placement and an adjustment mechanism is proposed to improve the QoS levels of tasks in the edge-cloud. The primary copy placement is to guarantee the earlier execution of the primary copy of a task to better satisfy the time requirements of tasks. The backup copy placement is to ensure the later execution of the backup copy of a task, reducing the overlapping of the two copies of a task, realizing the improvement of the resource utilization in the edge-cloud under the condition of redundancy and deadline requirements of tasks. The adjustment mechanism is triggered to rearrange the task copies of a computing node of the edge-cloud after the deallocation of a backup copy on the node, to better assist the goal-achievement of the primary and backup copy scheduling. Finally, through extensive simulation experiments with the real world taxi traces, the performance difference between the proposed method and the other four methods are evaluated. Results show that the proposed method generally outperforms the other methods in terms of guarantee ratio, average QoS level, and reliability cost. INDEX TERMS Edge-cloud, QoS, fault-tolerance, time constraint, primary-backup.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

QoS-Aware Task Placement With Fault-Tolerance in the Edge-Cloud

Sun

Fan

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Korst et al presented a necessary and sufficient schedulability condition for two tasks, which is a basic theorem to study the schedulability analysis for non-preemptive strictly periodic scheduling problem [2]. For harmonic period tasks, Eisenbrand proposed binary search trees to determine whether partitions are schedulable or not, while Omar kermai proposed FFID method [3], [4]. In addition, Kermia and Sorel proposed a necessary schedulability condition which was proven to be very restrictive [5].…”

Section: B Related Workmentioning

confidence: 99%

“…Al-Sheikh et al analyzed the non-preemptive and strictly periodic scheduling problem in Integrated Modular Avionics (IMA) platform, and presented a best-response algorithm based on the game theoretic approach to give an optimal solution [18], [19]. Pira [20], Jinchao Chen [6] and Kermai [3] did the similar work and presented the Line Search Method (LSM), eigentask and mapping function (EMTA) and TASC respectively to solve the problem. In [4], Eisenbrand considered the problem of scheduling tasks on a minimum processor platform.…”

Section: B Related Workmentioning

confidence: 99%

Research on Partition Parameter Design Method for Integrated Modular Avionics Based on MOEA/D-ADV

2020

View full text Add to dashboard Cite

In the avionics industry, Integrated Modular Avionics (IMA) which introduces the concept of partition has been widely adopted for its isolating capability. However, the real-time performance of the IMA system mainly depends on the partition parameters. This leads to the question of how to design the partition parameters for satisfying the timing requirements of real-time applications. In this paper, the problem of partition parameter design for multiprocessors system is investigated. Firstly, the hierarchical scheduling strategy of IMA is analyzed, and a new schedulability analysis method is proposed to judge the schedulability of the partitions according to the partition period and execution time. Then, an approximation algorithm is developed to minimize the allocated bandwidth of the partitions while simultaneously guaranteeing tasks schedulability within the partitions. The harmonic period partitions, which are used as the constraint of partition parameter design, are realized by considering the scheduling mechanism of intrapartition and inter-partition. The total required bandwidth and the system overhead caused by partition scheduling are regarded as the optimization objective functions. Moreover, Multi-objective Evolutionary Algorithm Based on Decomposition (MOEA/D) method is improved by applying the Adjustment for the Direction Vectors (ADV) algorithm. Constrained Dominance Principle (CDP) is embedded into the improved algorithm to solve the constrained optimization problem. Consequently, simulation results show that the presented algorithm can achieve better coverage and uniformity than the compared algorithms while obtaining the partition parameters, and the system overhead and total required bandwidth can also be reduced.

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

Self Cite

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

An efficient approach for the multiprocessor non-preemptive strictly periodic task scheduling problem

Cited by 7 publications

References 13 publications

QoS-Aware Task Placement With Fault-Tolerance in the Edge-Cloud

QoS-Aware Task Placement With Fault-Tolerance in the Edge-Cloud

Research on Partition Parameter Design Method for Integrated Modular Avionics Based on MOEA/D-ADV

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

Contact Info

Product

Resources

About