Skip to main content
SpringerLink
Log in

Improved Blocking Time Analysis and Evaluation for the Multiprocessor Priority Ceiling Protocol

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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 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 Δ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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gracioli G, Fröhlich A, Pellizzoni R, Fischmeister S. Implementation and evaluation of global and partitioned scheduling in a real-time OS. Real-Time Syst., 2013, 49(6): 669–714.

    Article  MATH  Google Scholar 

  2. Brandenburg B. Scheduling and locking in multiprocessor real-time operating systems [Ph.D. Thesis]. The University of North Carolina at Chapel Hill, 2011.

  3. Brandenburg B, Calandrino J, Block A, Leontyev H, Anderson J. Real-time synchronization on multiprocessor: To block or not to block, to suspend or spin? In Proc. the 14th IEEE Real-Time Embedded Tec. App. Symp., April 2008, pp.342–353.

  4. Ras J, Cheng A. An evaluation of the dynamic and static multiprocessor priority ceiling protocol and the multiprocessor stack resource policy in an SMP systems. In Proc. the 15th IEEE RTAS, April 2009, pp.13–22.

  5. Rajkumar R. Real-time synchronization protocols for shared memory multiprocessors. In Proc. the 10th Int. Conf. Dist. Computing Syst., May 28-Jun. 1, 1990, pp.116–123.

  6. Block A, Leontyev H, Brandenburg B, Anderson J. A flexible real-time locking protocol for multiprocessors. In Proc. the 13th IEEE RTCSA, August 2007, pp.47–56.

  7. Brandenburg B, Anderson J. Optimality results for multi-processor real-time locking. In Proc. the 31st IEEE Real-Time Syst. Symp., Nov. 30-Dec. 3, 2010, pp.49–60.

  8. Sha L, Rajkumar R, Lehoczky J. Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. Computers, 1990, 39(9): 1175–1185.

    Article  MathSciNet  Google Scholar 

  9. Lakshmanan K, De Niz D, Rajkumar R. Coordinated task scheduling, allocation and synchronization on multiprocessors. In Proc. the 30th IEEE Real-Time Syst. Symp., Dec. 2009, pp.469–478.

  10. Bril R, Lukkien J, Verhaegh W. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. J. Real-Time Syst., 2009, 42(1/2/3): 63–119.

  11. Bertogna M, Baruah S. Limited preemption EDF scheduling of sporadic task systems. IEEE Trans. Industrial Informatics, 2010, 6(4): 579–591.

    Article  Google Scholar 

  12. Schliecker S, Negrean M, Ernst R. Response time analysis on multicore ECUs with shared resources. IEEE Trans. Indus-trial Informatics, 2009, 5(4): 402–413.

    Article  Google Scholar 

  13. Brandenburg B. Improved analysis and evaluation of real-time semaphore protocols for P-FP scheduling. In Proc. the 19th IEEE RTAS, April 2013, pp.141–152.

  14. Ridouard F, Richard P, Cottet F. Negative results for scheduling independent hard real-time tasks with self-suspensions. In Proc. the 25th IEEE Real-Time Syst. Symp., December 2004, pp.47–56.

  15. Liu C, Layland J. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM, 1973, 20(1):46–61.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, China

    Mao-Lin Yang, Hang Lei & Yong Liao

  2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, China

    Furkan Rabee

Authors
  1. Mao-Lin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hang Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Furkan Rabee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mao-Lin Yang.

Additional information

This work was supported by the National Natural Science Foundation of China under Grant No. 61103041, the National High Technology Research and Development 863 Program of China under Grant No. 2012AA010904, the Fundamental Research Funds for the Central Universities of China under Grant No. ZYGX2012J070, the Huawei Technology Foundation under Grant No. IRP-2012-02-07, and the Excellent Ph.D. Student Academic Support Program of UESTC under Grant No. YBXSZC20131028.

Electronic supplementary material

Below is the link to the electronic supplementary material.

ESM 1

(PDF 109 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, ML., Lei, H., Liao, Y. et al. Improved Blocking Time Analysis and Evaluation for the Multiprocessor Priority Ceiling Protocol. J. Comput. Sci. Technol. 29, 1003–1013 (2014). https://doi.org/10.1007/s11390-014-1485-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-014-1485-y

Keywords

Search

Navigation