Open AccessGuaranteed Dynamic Priority Assignment Schemes for Real‐Time Tasks with (m, k)‐Firm Deadlines
Author(s) -
Cho Hyeonjoong,
Chung Yongwha,
Park Daihee
Publication year - 2010
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.10.0109.0544
Subject(s) - bounded function , scheduling (production processes) , computer science , mathematical optimization , quality of service , dynamic priority scheduling , mathematics , computer network , mathematical analysis
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.