ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Decentralized Task Scheduling for a Fixed Priority Multicore Embedded RTOS
Cited 3 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
김상철, 이성구
발행일
201506
출처
Computing, v.97 no.6, pp.543-555
ISSN
0010-485X
출판사
Springer
DOI
https://dx.doi.org/10.1007/s00607-013-0358-5
협약과제
13VC8500, 고성능과 실시간성을 위한 멀티코어 임베디드 시스템용 멀티프로세싱 RTOS 기술 개발, 마평수
초록
Parallel task execution on multiple cores is increasingly the norm in high-performance embedded systems. Many multicore real-time operating systems (RTOSes) support a fixed task priority policy, and many applications that execute on such platforms require high performance while adhering to the fixed task priority policy. This paper proposes a decentralized task scheduling problem for a fixed-priority multicore RTOS running a mix of sequential and parallel tasks. Since aggressive decentralized task scheduling can result in task priority inversions, a high-performance priority-preserving solution to the proposed problem is challenging. To address this problem, 32 possible candidate solutions are considered and simulation studies are used to evaluate them. From extensive evaluations based on carefully prepared performance metrics, it is found that policies based on number of tasks, waiting time and priority (NTWP) for sequential tasks and small subtask first, then minimum number of tasks (MIN?밠NT) for parallel tasks significantly outperform other possible candidates.
키워드
Embedded system, Multicore, Parallel computing, Realtime operating system, Task scheduling
KSP 제안 키워드
Embedded system, High performance, Parallel computing, Parallel tasks, Real-Time Operating System, Simulation study, Task priority, Waiting Time, decentralized task scheduling, fixed priority, performance metrics