期刊
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
卷 29, 期 6, 页码 1003-1013出版社
SCIENCE PRESS
DOI: 10.1007/s11390-014-1485-y
关键词
real-time scheduling; multiprocessor scheduling; locking protocol; blocking analysis; worst-case response time
资金
- National Natural Science Foundation of China [61103041]
- National High Technology Research and Development 863 Program of China [2012AA010904]
- Fundamental Research Funds for the Central Universities of China [ZYGX2012J070]
- Huawei Technology Foundation [2012-02-07]
- Excellent Ph.D. Student Academic Support Program of UESTC [YBXSZC20131028]
The Multiprocessor Priority Ceiling Protocol (MPCP) is a classic suspension-based real-time locking protocol for partitioned fixed-priority (P-FP) scheduling. However, existing blocking time analysis is pessimistic under the P-FP + MPCP scheduling, which negatively impacts the schedulability for real-time tasks. In this paper, we model each task as an alternating sequence of normal and critical sections, and use both the best-case execution time (BCET) and the worst-case execution time (WCET) to describe the execution requirement for each section. Based on this model, a novel analysis is proposed to bound shared resource requests. This analysis uses BCET to derive the lower bound on the inter-arrival time for shared resource requests, and uses WCET to obtain the upper bound on the execution time of a task on critical sections during an arbitrary time interval of Delta t. Based on this analysis, improved blocking analysis and its associated worst-case response time (WCRT) analysis are proposed for P-FP + MPCP scheduling. Schedulability experiments indicate that the proposed method outperforms the existing methods and improves the schedulability significantly.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据