Optimal on-line (m,k)-firm constraint assignment for real-time control tasks based on plant state information

Flavia, F.; Jia, Ning; Simonot-Lion, Françoise; Song, Ye-Qiong

doi:10.1109/etfa.2008.4638504

Cited by 11 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[47] analyses the stability and the opti-mality of a system governed by the (m, k)-firmness condition. [38] and [28] assign a scheduling architecture for a set of control applications to meet their requirements in presence of DMs. (ii) Quantification of a bound for DMs for a given set of applications and platform parameters.…”

Section: Related Workmentioning

confidence: 99%

Firmness Analysis of Real-time Tasks

Behrouzian

Ara

Geilen

et al. 2020

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

This thesis is the result of team work and the following people directly or indirectly contributed in that Prof. Twan Basten, my promoter, directed me in this journey. His vision on the bigger picture was the key. Thank you Twan for patiently guiding me through this project and getting me to the desired outcome. I would like to thank Dr. Dip Goswami, my daily supervisor, for his advice on the technical aspects. The early steps towards this thesis and later shaping it would not have been possible without your contribution. As always, I felt blessed to have my lifelong friend, Hadi Alizadeh, next to me in the past four years. Thank you Hadi for your invaluable support. A big thanks to Dr. Marc Geilen. You always offered your help despite your busy schedule and the fact that you were not my official supervisor. I would like to thank Dr. Madjid Nabi who was a great support especially in the beginning of my PhD study. My heartfelt gratitude goes to my fellow PhD students, Rasool Tavakoli,

show abstract

Section: Related Workmentioning

confidence: 99%

Firmness Analysis of Real-time Tasks

Behrouzian

Ara

Geilen

et al. 2020

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…There have been many attempts to apply (m, k)-firm deadline constraints to various applications, including a vehicle control system [14], a plant control [15], and real-time streams on multihop networks [16]. Recently, researchers have been addressing more complicated problems combining (m, k)-firm deadline constraints and other research issues including energy-efficiency, multiprocessors, etc [17], [6], [18], and [19].…”

Section: Related Workmentioning

confidence: 99%

Guaranteed Dynamic Priority Assignment Schemes for Real-Time Tasks with (m, k)-Firm Deadlines

Cho¹,

Chung²,

Park³

2010

ETRI J

View full text Add to dashboard Cite

We present guaranteed dynamic priority assignment schemes for multiple real‐time tasks subject to (m, k)‐firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)‐firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)‐firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)‐firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

show abstract

“…In general, traditional approaches for software‐based control typically follow fully periodic execution of the loops. However, existing research [3–7] has demonstrated that the control law computation/update need not be performed in every control‐loop iteration and in the case of such well‐defined patterns of loop skippings, the control signals of the previous iterations are simply carried over. The primary motivation of these works is to manage the overload of the shared ECU/network by incorporating such loop skipping/drops in the execution of control loops.…”

Section: Introductionmentioning

confidence: 99%

“…Research carried out in [3, 4, 6] shows the usefulness of non‐uniform execution of controllers. The works presented in [3, 5, 6] report design of stable (or robust) controllers given the plant models, the sampling period and

falsefalse⟨ m, k falsefalse⟩

‐firm constraints that specify the execution patterns for the control loops. The execution of a control loop according to a

falsefalse⟨ m, k falsefalse⟩

‐firm constraint means that at least m loop executions are successful in any k consecutive sampling intervals.…”

Section: Introductionmentioning

confidence: 99%

“…However, in a real‐time setting, it is also important to study the execution of control loops following window‐based specifications in the presence of drops induced by external non‐idealities which are also specified using window‐based specifications. As a motivating example, let us consider the harmonic oscillator system given in [5]. The control loop is stable for any possible execution pattern, which satisfies a window‐based specification