Evolving scheduling heuristics with genetic programming for optimization of quality of service in weakly hard real-time systems

Salamun, Karla; Pavić, Ivan; Džapo, Hrvoje; Đurasević, Marko

doi:10.1016/j.asoc.2023.110141

Cited by 8 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [ 80 ], the performance of the BWP and RLP algorithms was improved by introducing a hyper-heuristic approach for optimizing the QoS. More precisely, heuristics evolved by genetic programming were used for assigning priorities of blue jobs.…”

Section: Overview Of Scheduling Approachesmentioning

confidence: 99%

Weakly Hard Real-Time Model for Control Systems: A Survey

Salamun

Pavić

Džapo

et al. 2023

Sensors

Self Cite

View full text Add to dashboard Cite

The concept of weakly hard real-time systems can be used to model real-time systems that may tolerate occasional deadline misses in a bounded and predictable manner. This model applies to many practical applications and is particularly interesting in the context of real-time control systems. In practice, applying hard real-time constraints may be too rigid since a certain amount of deadline misses is acceptable in some applications. In order to maintain system stability, limitations on the amount and distribution of violated deadlines need to be imposed. These limitations can be formally expressed as weakly hard real-time constraints. Current research in the field of weakly hard real-time task scheduling is focused on designing scheduling algorithms that guarantee the fulfillment of constraints, while aiming to maximize the total number of timely completed task instances. This paper provides an extensive literature review of the work related to the weakly hard real-time system model and its link to the field of control systems design. The weakly hard real-time system model and the corresponding scheduling problem are described. Furthermore, an overview of system models derived from the generalized weakly hard real-time system model is provided, with an emphasis on models that apply to real-time control systems. The state-of-the-art algorithms for scheduling tasks with weakly hard real-time constraints are described and compared. Finally, an overview of controller design methods that rely on the weakly hard real-time model is given.

show abstract

Section: Overview Of Scheduling Approachesmentioning

confidence: 99%