Contention-Free Scheduling for Single Preemption Multiprocessor Platforms
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baek, Hyeongboo | - |
dc.contributor.author | Lee, Jaewoo | - |
dc.date.accessioned | 2023-10-20T01:41:27Z | - |
dc.date.available | 2023-10-20T01:41:27Z | - |
dc.date.issued | 2023-08 | - |
dc.identifier.issn | 2227-7390 | - |
dc.identifier.issn | 2227-7390 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/68163 | - |
dc.description.abstract | The Contention-Free (CF) policy has been extensively researched in the realm of real-time multi-processor scheduling due to its wide applicability and the performance enhancement benefits it provides to existing scheduling algorithms. The CF policy improves the feasibility of executing other real-time tasks by assigning the lowest priority to a task at a moment when it is guaranteed not to miss its deadline during the remaining execution time. Despite its effectiveness, existing studies on the CF policy are largely confined to preemptive scheduling, leaving the efficiency and applicability of limited preemption scheduling unexplored. Limited preemption scheduling permits a job to execute to completion with a limited number of preemptions, setting it apart from preemptive scheduling. This type of scheduling is crucial when preemption or migration overheads are either excessively large or unpredictable. In this paper, we introduce SP-CF, a single preemption scheduling approach that incorporates the CF policy. SP-CF allows a preemption only once during each job’s execution, following a priority demotion under the CF policy. We also propose a new schedulability analysis method for SP-CF to determine whether each task is executed in a timely manner and without missing its deadline. Through simulation experiments, we demonstrate that SP-CF can significantly enhance the schedulability of the traditional rate-monotonic algorithm and the earliest deadline first algorithm. © 2023 by the authors. | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Multidisciplinary Digital Publishing Institute (MDPI) | - |
dc.title | Contention-Free Scheduling for Single Preemption Multiprocessor Platforms | - |
dc.type | Article | - |
dc.identifier.doi | 10.3390/math11163547 | - |
dc.identifier.bibliographicCitation | Mathematics, v.11, no.16 | - |
dc.description.isOpenAccess | Y | - |
dc.identifier.wosid | 001057631400001 | - |
dc.identifier.scopusid | 2-s2.0-85168950334 | - |
dc.citation.number | 16 | - |
dc.citation.title | Mathematics | - |
dc.citation.volume | 11 | - |
dc.type.docType | Article | - |
dc.publisher.location | 스위스 | - |
dc.subject.keywordAuthor | contention-free policy | - |
dc.subject.keywordAuthor | limited preemption scheduling | - |
dc.subject.keywordAuthor | real-time multi-processor scheduling | - |
dc.subject.keywordPlus | SCHEDULABILITY ANALYSIS | - |
dc.subject.keywordPlus | PRIORITY ASSIGNMENT | - |
dc.subject.keywordPlus | FREE POLICY | - |
dc.subject.keywordPlus | LEVEL | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang 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.