Constraint solving approach to schedulability analysis in real-time systems

Hyuk Lee, Jin Young Choi

Research output: Contribution to journalArticle

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.

Original languageEnglish
Article number8485678
Pages (from-to)58418-58426
Number of pages9
JournalIEEE Access
Volume6
DOIs
Publication statusPublished - 2018 Jan 1

Fingerprint

Real time systems
Scheduling

Keywords

  • Constraint satisfaction problem
  • real-time schedulability analysis
  • satisfiability modulo theories

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

Constraint solving approach to schedulability analysis in real-time systems. / Lee, Hyuk; Choi, Jin Young.

In: IEEE Access, Vol. 6, 8485678, 01.01.2018, p. 58418-58426.

Research output: Contribution to journalArticle

@article{2f4fc44223554584a11f32c892b0581a,
title = "Constraint solving approach to schedulability analysis in real-time systems",
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.",
keywords = "Constraint satisfaction problem, real-time schedulability analysis, satisfiability modulo theories",
author = "Hyuk Lee and Choi, {Jin Young}",
year = "2018",
month = "1",
day = "1",
doi = "10.1109/ACCESS.2018.2874637",
language = "English",
volume = "6",
pages = "58418--58426",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Constraint solving approach to schedulability analysis in real-time systems

AU - Lee, Hyuk

AU - Choi, Jin Young

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Constraint satisfaction problem

KW - real-time schedulability analysis

KW - satisfiability modulo theories

UR - http://www.scopus.com/inward/record.url?scp=85054520079&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054520079&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2018.2874637

DO - 10.1109/ACCESS.2018.2874637

M3 - Article

AN - SCOPUS:85054520079

VL - 6

SP - 58418

EP - 58426

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8485678

ER -