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

• Published in: ETRI journal Vol. 32; no. 3; pp. 422 - 429
• Main Authors: Cho, Hyeonjoong, Chung, Yongwha, Park, Daihee
• Format: Journal Article
• Language: English
• Published: 한국전자통신연구원 01.06.2010
• Subjects: (m, k)‐firm deadline; guaranteed dynamic priority assignment; Real‐time systems; 전자/정보통신공학
• ISSN: 1225-6463; 2233-7326
• DOI: 10.4218/etrij.10.0109.0544

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.