A Guaranteed Real-time Scheduling Algorithm for (m,k)-firm Deadline-constrained Tasks on Multiprocessors
- Authors
- Cho, Hyeonjoong; Gong, Yeonhwa
- Issue Date
- 9월-2013
- Publisher
- TAYLOR & FRANCIS LTD
- Keywords
- Guaranteed dynamic priority assignment; Real-time systems; (m,k)-firm deadline
- Citation
- IETE JOURNAL OF RESEARCH, v.59, no.5, pp.604 - 614
- Indexed
- SCIE
SCOPUS
- Journal Title
- IETE JOURNAL OF RESEARCH
- Volume
- 59
- Number
- 5
- Start Page
- 604
- End Page
- 614
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/102238
- DOI
- 10.4103/0377-2063.123767
- ISSN
- 0377-2063
- Abstract
- We present a guaranteed real-time scheduling algorithm for multiple real-time tasks subject to (m, k)-firm deadlines on homogeneous multiprocessors. The scheduling objective of the proposed algorithm is to provide guaranteed performance by bounding the probability of missing (m, k)-firm deadline constraints while improving the probability of deadline satisfactions as much as possible. This goal is established to satisfy the minimum requirements expressed by (m, k)-firm deadlines and simultaneously provide the best possible quality of service. We first introduce a novel abstraction for reasoning about the execution behaviors of tasks constrained by (m, k)-firm deadlines on multiprocessors. Based on it, we propose a guaranteed real-time scheduling algorithm for (m, k)-firm deadline-constrained tasks on multiprocessors. We analytically establish that the proposed algorithm provides assurance 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 scheme in achieving our scheduling objective.
- 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
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.