Quality of Service Scheduling in the Firm Real-Time Systems

Queudet-Marchand, Audrey; Chetto, Maryline

doi:10.5772/37318

Cited by 2 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scheduling task sets with skippable jobs was further researched by authors Marchand and Silly-Chetto [ 71 , 72 , 73 ]. The authors have introduced the Red Tasks as Late as Possible (RLP) algorithm, which stimulates the execution of blue jobs by executing them at idle times of a preliminary schedule considering only the red jobs.…”

Section: Overview Of Scheduling Approachesmentioning

confidence: 99%

“…Moreover, once the idle intervals are known, it can be decided online whether it is feasible to accept blue jobs. The online computation of available slack time is required when a blue job is released while there are no active blue jobs in the system and after the completion of a blue job, if blue jobs remain in the system [ 73 ].…”

Section: Overview Of Scheduling Approachesmentioning

confidence: 99%

“… A comparison of job-skipping algorithms with respect to the dynamic overhead. Data taken from [ 73 ]. …”

Section: Figurementioning

confidence: 99%

See 2 more Smart Citations

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

Salamun

Pavić

Džapo

et al. 2023

Sensors

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%

Section: Overview Of Scheduling Approachesmentioning

confidence: 99%