Benner
فرقان حسن ربيع ( مدرس )
كلية علوم الحاسوب والرياضيات - الحاسوب
[email protected]
009647801200299
 
 
 
time analysis and evaluation for the multiprocessor priority ceiling protocol
بحث النوع:
هندسة التخصص العام:
Yang ML اسم الناشر:
Lei H, Liao Y. , Furkan Rabee اسماء المساعدين:
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY الجهة الناشرة:
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY  
2014 سنة النشر:

الخلاصة

Abstract 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 the BCET to derive the lower bound on the inter-arrival time for shared resource requests, and uses the WCET to obtain the upper bound on the execution time of a task on critical sections during an arbitrary time interval of Δ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.