A Guaranteed Real-time Scheduling Algorithm for (m,k)-firm Deadline-constrained Tasks on Multiprocessors
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Hyeonjoong | - |
dc.contributor.author | Gong, Yeonhwa | - |
dc.date.accessioned | 2021-09-05T22:01:47Z | - |
dc.date.available | 2021-09-05T22:01:47Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2013-09 | - |
dc.identifier.issn | 0377-2063 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/102238 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.subject | STREAMS | - |
dc.subject | (M | - |
dc.title | A Guaranteed Real-time Scheduling Algorithm for (m,k)-firm Deadline-constrained Tasks on Multiprocessors | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, Hyeonjoong | - |
dc.identifier.doi | 10.4103/0377-2063.123767 | - |
dc.identifier.scopusid | 2-s2.0-84892687437 | - |
dc.identifier.wosid | 000330131400019 | - |
dc.identifier.bibliographicCitation | IETE JOURNAL OF RESEARCH, v.59, no.5, pp.604 - 614 | - |
dc.relation.isPartOf | IETE JOURNAL OF RESEARCH | - |
dc.citation.title | IETE JOURNAL OF RESEARCH | - |
dc.citation.volume | 59 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 604 | - |
dc.citation.endPage | 614 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | STREAMS | - |
dc.subject.keywordPlus | (M | - |
dc.subject.keywordAuthor | Guaranteed dynamic priority assignment | - |
dc.subject.keywordAuthor | Real-time systems | - |
dc.subject.keywordAuthor | (m,k)-firm deadline | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.