期刊
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
卷 34, 期 4, 页码 839-853出版社
SCIENCE PRESS
DOI: 10.1007/s11390-019-1945-5
关键词
multiprocessor real-time scheduling; partitioned fixed-priority scheduling; shared resource; integer linear programming
资金
- National Natural Science Foundation of China [61572112, 61802052]
- Applied Basic Research Programs of Science and Technology Department in Sichuan Province of China [2019YJ0185]
Coordinated partitioning and resource sharing have attracted considerable research interest in the field of real-time multiprocessor systems. However, finding an optimal partition is widely known as NP-hard, even for independent tasks. A recently proposed resource-oriented partitioned (ROP) fixed-priority scheduling that partitions tasks and shared resources respectively has been shown to achieve a non-trivial speedup factor guarantee, which promotes the research of coordinated scheduling to a new level. Despite the theoretical elegance, the schedulability performance of ROP scheduling is restricted by the heuristic partitioning methods used in the original study. In this paper, we address the partitioning problem for tasks and shared resources under the ROP scheduling. A unified schedulability analysis framework for the ROP scheduling is proposed in the first place. A sophisticated partitioning approach based on integer linear programming (ILP) is then proposed based on the unified analysis. Empirical results show that the proposed methods improve the schedulability of ROP scheduling significantly, and the runtime complexity for searching a solution is reduced prominently compared with other ILP-based approaches as well.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据