Preemptive real-time scheduling incorporating security constraint for cyber physical systems사이버 물리 시스템을 위한 보안 제약 사항을 통합한 실시간 스케줄링 기법 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 678
  • Download : 0
Real-time embedded systems have been designed to perform specific functionalities and they have been evolving in very complex structures as computing and control technology have developed. A cyber physical system (CPS) is a computer system that controls multiple physical devices. Such physical systems need to meet various requirements simultaneously, including high performance, real-time functioning, and a high level of reliability and security. Among the requirements, this dissertation proposes mechanisms to satisfy the requirements of high performance and security. For the high performance requirement, we address the scheduling problem of multi-processor. For several decades, real-time scheduling on uni-processor have been well studied. Earliest deadline first (EDF), the optimal scheduling algorithm on uni-processor, is a typical example of successful results of such researches. Unlike uniprocessor scheduling, EDF shows relatively poor performance on global multiprocessor scheduling. As no other global JFP multiprocessor algorithms are illuminated beyond EDF, this dissertation proposes one, called earliest quasi-deadline first (EQDF). This dissertation then seeks to explore how it can improve the schedulability of global JFP scheduling. For the security requirement, this dissertation proposes mechanisms to meet both of time and security constraints simultaneously. Since real-time systems typically relies on real-time scheduling, to conserve real-time property is the fundamental issue for security mechanism design. Addressing this issue, previous works have proposed approaches to add a security constraint to the real-time properties to cope with the information leakage problem that can arise between real-time tasks with different security levels. However, conventional works have mainly focused on non-preemptive scheduling and have suggested a very naive approach for preemptive scheduling, which shows limited analytical capability. In this dissertation, we present a new preemptive fixed-priority scheduling algorithm incorporating a security constraint, called lowest security-level first (LSF) and its strong schedulability analysis to reduce the potential of information leakage.
Advisors
Yoon, Hyunsooresearcher윤현수researcher
Description
한국과학기술원 :전산학부,
Publisher
한국과학기술원
Issue Date
2016
Identifier
325007
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학부, 2016.8 ,[v, 61 p. :]

Keywords

real-time systems; real-time scheduling; schedulability; multi-processor; security; 사이버 물리 시스템; 실시간 스케줄링; 실시간성; 멀티 프로세서; 보안

URI
http://hdl.handle.net/10203/222415
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=663208&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0