首页 | 本学科首页   官方微博 | 高级检索  
     


Improved Task and Resource Partitioning Under the Resource-Oriented Partitioned Scheduling
Authors:Chen  Ze-Wei  Lei   Hang  Yang   Mao-Lin  Liao   Yong  Yu   Jia-Li
Affiliation:1.School of Information and Software Engineering, University of Electronic Science and Technology of China Chengdu 610054, China;2.School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 610054, China
Abstract:

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.

Keywords:multiprocessor real-time scheduling  partitioned fixed-priority scheduling  shared resource  integer linear programming  
本文献已被 万方数据 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号