Decomposition-Based Real-Time Scheduling of Parallel Tasks on Multicores Platforms

Xu Jiang, Nan Guan, Xiang Long, Han Wan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

Abstract

Multicore processors have become mainstream computation platforms not only for general and high-performance computers but also for real-time embedded systems. To fully utilize the computation power of multicores, software must be parallelized. Recently, there has been a rapidly increasing interest in real-time scheduling of parallel real-time tasks, but the field is still much less mature than traditional real-time scheduling of sequential tasks. In this article, we study the real-time scheduling and techniques for parallel real-time tasks based on decomposition, where a task graph is transferred to a set of independent sporadic tasks. In particular, we propose new decomposition strategies that better explore the structure feature of each task to improve schedulability. We develop schedulability tests for the global earliest deadline first (EDF) scheduling algorithm based on decomposition and three types of its variants, with their own pros and cons in different aspects. We conduct experiments to evaluate the real-time performance of our proposed scheduling algorithms against the state-of-the-art scheduling and analysis methods of different types.
Original languageEnglish
Pages (from-to)2319-2332
Number of pages14
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Publication statusPublished - 2020

Cite this