Guaranteed Dynamic Priority Assignment Schemes for Real-Time Tasks with (m, k)-Firm Deadlines
- Authors
- Cho, Hyeonjoong; Chung, Yongwha; Park, Daihee
- Issue Date
- 6월-2010
- Publisher
- WILEY
- Keywords
- Real-time systems; (m, k)-firm deadline; guaranteed dynamic priority assignment
- Citation
- ETRI JOURNAL, v.32, no.3, pp.422 - 429
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- ETRI JOURNAL
- Volume
- 32
- Number
- 3
- Start Page
- 422
- End Page
- 429
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/116305
- DOI
- 10.4218/etrij.10.0109.0544
- ISSN
- 1225-6463
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer and Information Science > 1. Journal Articles
- College of Science and Technology > Department of Computer Convergence Software > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.