Advertisement

Asynchronous Critical Sections in Real-Time Multiprocessor Systems

  • Michael SchmidEmail author
  • Jürgen Mottok
Conference paper
  • 508 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11479)

Abstract

Sharing data across multiple tasks in multiprocessor systems has intensively been studied in the past decades. Various synchronization protocols, the most well-known being the Priority Inheritance Protocol or the Priority Ceiling Protocol, have been established and analyzed so that blocking times of tasks waiting to access a shared resource can be upper bounded. To the best of our knowledge, all of these protocols share one commonality: Tasks that want to enter a critical section, that is already being executed by another task, immediately get blocked. In this paper, we introduce the Asynchronous Priority Ceiling Protocol (A-PCP), which makes use of aperiodic servers to execute the critical sections asynchronously, while the calling task can continue its work on non-critical section code. For this protocol, we provide a worst-case response time analysis of the asynchronous computations, as well as necessary and sufficient conditions for a feasibility analysis of a set of periodic tasks using the proposed synchronization model on a system that preemptively schedules the tasks under the rate-monotonic priority assignment.

References

  1. 1.
    Brandenburg, B.B., Anderson, J.H.: A comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 105–124. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-92221-6_9CrossRefGoogle Scholar
  2. 2.
    Lakshmanan, K., de Niz, D., Rajkumar, R.: Coordinated task scheduling, allocation and synchronization on multiprocessors. In: 2009 30th IEEE Real-Time Systems Symposium, pp. 469–478, December 2009Google Scholar
  3. 3.
    Liu, J.W.S.: Real-Time Systems. Prentice Hall, Upper Saddle River (2000)Google Scholar
  4. 4.
    Midonnet, S., Fauberteau, F.: Synchronizations: Shared Resource Access Protocols, pp. 149–191. Wiley, Hoboken (2014)Google Scholar
  5. 5.
    Rajkumar, R.: Real-time synchronization protocols for shared memory multiprocessors. In: Proceedings, 10th International Conference on Distributed Computing Systems, pp. 116–123, May 1990Google Scholar
  6. 6.
    Rajkumar, R., Sha, L., Lehoczky, J.P.: Real-time synchronization protocols for multiprocessors. In: Proceedings Real-Time Systems Symposium, pp. 259–269, December 1988Google Scholar
  7. 7.
    Schmidt, D.C., Stal, M., Rohnert, H., Buschmann, F.: Pattern-Oriented Software Architecture, Patterns for Concurrent and Networked Objects, vol. 2. Wiley, Hoboken (2000)zbMATHGoogle Scholar
  8. 8.
    Sha, L., Rajkumar, R., Lehoczky, J.P.: Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans. Comput. 39(9), 1175–1185 (1990)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Strosnider, J.K., Lehoczky, J.P., Sha, L.: The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Trans. Comput. 44(1), 73–91 (1995)CrossRefGoogle Scholar
  10. 10.
    Yang, M.L., Lei, H., Liao, Y., Rabee, F.: Improved blocking time analysis and evaluation for the multiprocessor priority ceiling protocol. J. Comput. Sci. Technol. 29(6), 1003–1013 (2014)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Laboratory for Safe and Secure Systems - LaS³University of Applied Sciences RegensburgRegensburgGermany

Personalised recommendations