Decentralized task scheduling for a fixed priority multicore embedded RTOS

Abstract

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–MNT) for parallel tasks significantly outperform other possible candidates.