A Novel Schedulability Test Algorithm for Preemptive Real-Time Scheduling Problem in QCSP

2016 ◽  
Author(s):  
Ju-Yang Zhang
Keyword(s):  
Real Time ◽  
Scheduling Problem ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Schedulability Test ◽  
Test Algorithm

Multithreading MAS Platform for Real-Time Scheduling

2016 ◽  
Vol 4 (1) ◽  
pp. 48-60 ◽  
Author(s):  
Yaroslav Shepilov ◽  
Daria Pavlova ◽  
Daria Kazanskaia
Keyword(s):  
Real Time ◽  
Scheduling Problem ◽  
Optimal Resource Allocation ◽  
Dynamic Changes ◽  
Real Time Scheduling ◽  
Fast Solution ◽  
Agent Scheduling ◽  
Time Scheduling ◽  
Optimal Resource ◽  
Multi Agent

The scheduling is the process of the optimal resource allocation that is widely used both in everyday life and specific domains. In the paper the description of scheduling problem is given. The authors consider traditional methods and tools for solving this problem, then describe the proposed approach based on multi-agent technologies and multithreading application. Nowadays there exist numerous approaches to solving of the scheduling problem. In the most of cases this process has to be supported and managed by the complex tools, sometimes based on mathematical principles. The suggested method of multithreading multi-agent scheduling allows efficient and fast solution of complex problems in real-time featuring rapid dynamic changes and uncertainty that cannot be handled by the other methods and tools.

scholarly journals Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

2010 ◽  
pp. 11-22 ◽  
Author(s):  
Friedrich Eisenbrand ◽  
Karthikeyan Kesavan ◽  
Raju S. Mattikalli ◽  
Martin Niemeier ◽  
Arnold W. Nordsieck ◽  
...  
Keyword(s):  
Real Time ◽  
Scheduling Problem ◽  
Real Time Scheduling ◽  
Time Scheduling

On a Real-Time Scheduling Problem

1978 ◽  
Vol 26 (1) ◽  
pp. 127-140 ◽  
Author(s):  
Sudarshan K. Dhall ◽  
C. L. Liu
Keyword(s):  
Real Time ◽  
Scheduling Problem ◽  
Real Time Scheduling ◽  
Time Scheduling

scholarly journals Survey on Optimal Schedulability Test for Hard Real Time Scheduling

IJARCCE ◽  
2015 ◽  
Vol 4 (5) ◽  
pp. 746-753
Author(s):  
Nitin C. Patil ◽  
Prof. Dhanure S. P
Keyword(s):  
Real Time ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Schedulability Test ◽  
Hard Real Time

QCSP Based Schedulability Test of Real-Time System

2013 ◽  
Vol 313-314 ◽  
pp. 1214-1217 ◽  
Author(s):  
Ju Yang Zhang ◽  
Yi Xiang Chen
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Constraint Satisfaction Problems ◽  
Test Method ◽  
Scheduling Problems ◽  
Real Time System ◽  
Scheduling System ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Schedulability Test

The problem of schedulability test of real-time task in scheduling system has been addressed. In such as real-time scheduling problems with uncertain interrupt operation, Quantified Constraint Satisfaction Problems (QCSP) were introduced to model and solve CSP involving uncertainty or uncontrollability on the value taken by some variables. In this paper, we propose to a novel approach to schedulability test based on the QCSP model. Based on the QCSP model of scheduler and interrupter in the real-time scheduling system, we transform the schedulability test into the satisfability problem. Finally, we design the algorithm QCSP-SchTest for judging the satisfability of a schedule S(α). This leads to a new schedulability test method without considering the specific scheduling algorithm or strategy.

Real-Time Embedded Systems Scheduling Optimization

2021 ◽  
Vol 12 (1) ◽  
pp. 43-73
Author(s):  
Fateh Boutekkouk
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Design Space ◽  
Artificial Immune Systems ◽  
Scheduling Problem ◽  
Future Directions ◽  
Real Time Scheduling ◽  
Energy Consumption Reduction ◽  
Consumption Reduction ◽  
Time Scheduling

The embedded real-time scheduling problem is qualified as a hard multi-objective optimization problem under constraints since it should compromise between three key conflictual objectives that are tasks deadlines guarantee, energy consumption reduction, and reliability enhancement. On this fact, conventional approaches can easily fail to find a good tradeoff in particular when the design space is too vast. On the other side, bio-inspired meta-heuristics have proved their efficiency even if the design space is very large. In this framework, the authors review the most pertinent works of literature targeting the application of bio-inspired methods to resolve the real-time scheduling problem for embedded systems, notably artificial immune systems, machine learning, cellular automata, evolutionary algorithms, and swarm intelligence. A deep discussion is conducted putting the light on the main challenges of using bio-inspired methods in the context of embedded systems. At the end of this review, the authors highlight some of the future directions.

Sign in / Sign up

Export Citation Format

Share Document