Constraint Solving Approach to Schedulability Analysis in Real-Time Systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Hyuk | - |
dc.contributor.author | Choi, Jin-Young | - |
dc.date.accessioned | 2021-09-02T21:10:34Z | - |
dc.date.available | 2021-09-02T21:10:34Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2018 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/80908 | - |
dc.description.abstract | In real-time systems, the satisfaction of real-time properties is as important as the correct behavior of the function. There are many safety-critical systems among the real-time systems, and thus, the satisfaction of real-time properties is directly related to safety in those cases. By performing the schedulability analysis, we can predict the behavior of real-time systems and ensure that real-time properties are met. In this paper, we propose the schedulability analysis of a real-time system through a constraint solving approach, that is, by treating a scheduling problem as a constraint solving problem. To do this, we describe a method of representing the task behavior and schedulable properties of real-time tasks in the form of constraints and finding answers that satisfy all the constraints using a constraint solver. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | PROCESS ALGEBRAIC APPROACH | - |
dc.subject | TASK SYSTEMS | - |
dc.title | Constraint Solving Approach to Schedulability Analysis in Real-Time Systems | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Hyuk | - |
dc.contributor.affiliatedAuthor | Choi, Jin-Young | - |
dc.identifier.doi | 10.1109/ACCESS.2018.2874637 | - |
dc.identifier.scopusid | 2-s2.0-85054520079 | - |
dc.identifier.wosid | 000449629600001 | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.6, pp.58418 - 58426 | - |
dc.relation.isPartOf | IEEE ACCESS | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 6 | - |
dc.citation.startPage | 58418 | - |
dc.citation.endPage | 58426 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | PROCESS ALGEBRAIC APPROACH | - |
dc.subject.keywordPlus | TASK SYSTEMS | - |
dc.subject.keywordAuthor | Constraint satisfaction problem | - |
dc.subject.keywordAuthor | satisfiability modulo theories | - |
dc.subject.keywordAuthor | real-time schedulability analysis | - |
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.