한국컴퓨터정보학회:학술대회논문집 (Proceedings of the Korean Society of Computer Information Conference)

한국컴퓨터정보학회 (Korean Society of Computer Information)
권호 표지

멀티 혼합 중요도 시스템에서 태스크 마이그레이션의 스케줄가능성 분석

Schedulability Analysis for Task Migration under Multiple Mixed-Criticality Systems

  • 백전성 (한양대학교, 컴퓨터공학과) ;
  • 강경태 (한양대학교, 컴퓨터공학과)
  • Baik, Jeanseong (Dept. of Computer Science & Engineering, Hanyang University) ;
  • Kang, Kyungtae (Dept. of Computer Science & Engineering, Hanyang University)
  • 발행 : 2019.07.10
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we applied the migration technique to real-time tasks that have relatively low criticality but still important to be dropped by the mixed-criticality scheduling algorithms. The proposed drop and migrate algorithm analyzes the schedulability by calculating CPU utilization and response time of using task migration. We provide analysis to guarantee the deadline of LO-tasks, by transforming the response time equation specified with migration time. The transformed response time equation was able to analyze the migration schedulability. This algorithm can be used with various mixed-criticality schedulers as a supplementary method. We expect this algorithm will be used for scheduling LO-tasks such as communication task that requires safety guarantee especially in platooning and autonomous driving by utilizing the advantages of multiple node connectivities.

키워드