Home| Contact Us| New Journals| Browse Journals| Journal Prices| For Authors|

Print ISSN: 0976-4143
Online ISSN:
0976-4151


  About JISR
  DLINE Portal Home
Home
Aims & Scope
Editorial Board
Current Issue
Next Issue
Previous Issue
Sample Issue
Upcoming Conferences
Self-archiving policy
Alert Services
Be a Reviewer
Publisher
Paper Submission
Subscription
Contact us
 
  How To Order
  Order Online
Price Information
Request for Complimentary
Print Copy
 
  For Authors
  Guidelines for Contributors
Online Submission
Call for Papers
Author Rights
 
 
RELATED JOURNALS
Journal of Digital Information Management (JDIM)
International Journal of Computational Linguistics Research (IJCL)
International Journal of Web Application (IJWA)

 

 
Journal of Information Security Research

Synchronization Processors in the Distributed Multiprocessor Real-time Locking Protocols
Björn B. Brandenburg
Max Planck Institute for Software Systems (MPI-SWS) Paul-Ehrlich-Straße G 26, 67663 Kaiserslautern, Germany
Abstract: Our research delves into the fascinating world of distributed multiprocessor real-time locking protocols, where resources can only be accessed through certain synchronization processors. We establish the minimum and maximum priority inversion blocking limits that are typically unavoidable in these protocols, building on the foundation laid by previous research on suspension-based shared-memory multiprocessor locking protocols. The W (m) and W (n) maximum pi-blocking under suspension-oblivious and suspension-aware analysis, respectively, where m denotes the total number of processors and n denotes the number of tasks. This paper shows that, in the case of distributed semaphore protocols, two task allocation scenarios exist that give rise to distinct lower bounds. In the case of co-hosted task allocation, where application tasks may also be assigned to synchronisation processors (i.e., processors hosting critical sections), W (F · n maximum pi-blocking is unavoidable for some tasks under any locking protocol under both suspension-aware and suspension-oblivious schedulability analysis, where F denotes the ratio of the maximum response time to the shortest period. In contrast, in the case of disjoint task allocation (i.e., if application tasks may not be assigned to synchronization processors), only W (m) and W(n) maximum pi-blocking is fundamentally unavoidable under suspension-oblivious and suspension-aware analysis, respectively, as in the shared-memory case. These bounds are shown to be asymptotically tight with the construction of two new distributed real-time locking protocols that ensure O(m) and O(n) maximum pi-blocking under suspension-oblivious.
Keywords: Distributed Multiprocessor Real-time Systems, Real-time Locking, Priority Inversion, Blocking Optimality Synchronization Processors in the Distributed Multiprocessor Real-time Locking Protocols
DOI:https://doi.org/10.6025/jisr/2024/15/2/35-58
Full_Text   PDF 2.94 MB   Download:   8  times
References:[1] Audsley, Neil C., Burns, Alan, Richardson, Michael F., Tindell, Ken, & Wellings, Andy J. (1993). Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal, 8(5), 284–292. [2] Baker, Theodore P. (1991). Stack-based scheduling of real-time processes. Real-Time Systems, 3(1), 67–99. https://doi.org/10.1007/BF00365393 [3] Baker, Theodore P. (2003). Multiprocessor EDF and deadline monotonic schedulability analysis. In 24th IEEE Real-Time Systems Symposium, RTSS’03 (pp. 120–129). IEEE Computer Society. https://doi.org/10.1109/REAL.2003.1253260 [4] Baruah, Sanjoy K. (2007). Techniques for multiprocessor global schedulability analysis. In 28th IEEE Real-Time Systems Symposium, RTSS’07 (pp. 119–128). IEEE Computer Society. https://doi.org/10.1109/RTSS.2007.48 [5] Baruah, Sanjoy K., Bonifaci, Vincenzo, Marchetti-Spaccamela, Alberto, & Stiller, Sebastian. (2010). Improved multiprocessor global schedulability analysis. Real-Time Systems, 46(1), 3–24. https://doi.org/10.1007/s11241-010-9096- [6] Baumann, Andrew., Barham, Paul., Dagand, Pierre Évariste., Harris, Timothy L., Isaacs, Rebecca, Peter, Simon, Roscoe, Timothy, Schüpbach, Adrian, & Singhania, Akhilesh. (2009). The multikernel: a new OS architecture for scalable multicore systems. In Matthews, Jeanna Neefe, & Anderson, Thomas E. (Eds.), 22nd ACM Symposium on Operating Systems Principles 2009, SOSP’09 (pp. 29–44). ACM. https://doi.org/10.1145/1629575.1629579 [7] Bertogna, Marko., Cirinei, Michele. (2007). Response-time analysis for globally scheduled symmetric multiprocessor platforms. In 28th IEEE Real-Time Systems Symposium, RTSS’07 (pp. 149–160). IEEE Computer Society. https://doi.org/10.1109/RTSS.2007.41 [8] Bertogna, Marko., Cirinei, Michele., Lipari, Giuseppe. (2005). Improved schedulability analysis of EDF on multiprocessor platforms. In 17th Euromicro Conference on Real-Time Systems, ECRTS’05 (pp. 209–218). IEEE Computer Society. https://doi.org/10.1109/ECRTS.2005.18 [9] Bertogna, Marko., Cirinei, Michele., Lipari, Giuseppe. (2009). Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Transactions on Parallel and Distributed Systems, 20(4), 553–566. https://doi.org/10.1109/TPDS.2008.129 [10] Block, Aaron, Leontyev, Hennadiy, Brandenburg, Björn B., Anderson, James H. (2007). A flexible real-time locking protocol for multiprocessors. In 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA’07 (pp. 47–56). IEEE Computer Society. https://doi.org/10.1109/RTCSA.2007. [11] Brandenburg, Björn B. (2013). A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications. In 25th Euromicro Conference on Real-Time Systems, ECRTS’13 (pp. 292–302). IEEE. doi:10.1109/ECRTS.2013.38. [12] Brandenburg, Björn B. (2013). Improved Analysis and Evaluation of Real-Time Semaphore Protocols for P-FP Scheduling. In 19th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS’13 (pp. 141–152). IEEE Computer Society. doi:10.1109/RTAS.2013.6531087 [13] Brandenburg, Björn B. (2014). The FMLP+: An Asymptotically Optimal Real-Time Locking Protocol for Suspension-Aware Analysis. In 26th Euromicro Conference on Real-Time Systems, ECRTS’14 (pp. 61–71). IEEE. [14] Brandenburg, Björn B. (2013). Improved analysis and evaluation of real-time semaphore protocols for P-FP scheduling. In 19th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS’13 (pp. 141–152). IEEE Computer Society. [15] Brandenburg, Björn B. (2014). The FMLP+: An asymptotically optimal real-time locking protocol for suspension-aware analysis. In 26th Euromicro Conference on Real-Time Systems, ECRTS’14 (pp. 61–71). IEEE. [16] Brandenburg, Björn B., Anderson, James H. (2010). Optimality results for multiprocessor real-time locking. In 31st IEEE Real-Time Systems Symposium, RTSS’10 (pp. 49–60). IEEE Computer Society. [17] Brandenburg, Björn B., Anderson, James H. (2010). Spin-based reader-writer synchronization for multiprocessor real-time systems. Real-Time Systems, 46(1), 25–87.

[18] Brandenburg, Björn B., Anderson, James H. (2012). The OMLP family of optimal multiprocessor real-time locking protocols. Design Automation for Embedded Systems, online first, 1–66. doi:10.1007/s10617-012-9090-1.

[19] Brandenburg, Björn B., Calandrino, John M., Block, Aaron, Leontyev, Hennadiy, & Anderson, James H. (2008). Real-time synchronization on multiprocessors: To block or not to block, to suspend or spin? In 14th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS’08 (pp. 342–353). IEEE Computer Society. doi:10.1109/RTAS.2008.27.

[20] Burns, Alan, Wellings, Andy J. (2013). A schedulability compatible multiprocessor resource sharing protocol – MrsP. In 25th Euromicro Conference on Real-Time Systems, ECRTS’13 (pp. 282–291). IEEE. doi:10.1109/ECRTS.2013.37.

[21] Carpenter, John, Funk, Shelby, Holman, Philip, Srinivasan, Anand, Anderson, James H., & Baruah, Sanjoy K. (2004). A categorization of real-time multiprocessor scheduling problems and algorithms. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman Hall/CRC.

[22] Chang, Yang, Davis, Robert I., Wellings, Andy J. (2010). Reducing Queue Lock Pessimism in Multiprocessor Schedulability Analysis. In 18th International Conference on Real-Time and Network Systems (pp. 99–108). Toulouse, France. Retrieved from http://hal.archives-ouvertes.fr/hal-00546915.

[23] Devi, UmaMaheswari C., Leontyev, Hennadiy, & Anderson, James H. (2006). Efficient synchronization under global EDF scheduling on multiprocessors. In 18th Euromicro Conference on Real-Time Systems, ECRTS’06 (pp. 75–84). IEEE Computer Society. doi:10.1109/ECRTS.2006.10.

[24] Easwaran, Arvind., Andersson, Björn. (2009). Resource sharing in global fixed-priority preemptive multiprocessor scheduling. In Theodore P. Baker (Ed.), 30th IEEE Real-Time Systems Symposium, RTSS’09 (pp. 377–386). IEEE Computer Society. doi:10.1109/RTSS.2009.37.

[25] Elliott, Glenn A., Anderson, James H. (2011). An optimal k-exclusion real-time locking protocol motivated by multi-GPU systems. In Sébastien Faucou, Alan Burns, & Laurent George (Eds.), 19th International Conference on Real-Time and Network Systems, RTNS’11 (pp. 15–24). Retrieved from http://rtns2011.irccyn.ec-nantes.fr/files/rtns2011.pdf.

[26] Faggioli, Dario, Lipari, Giuseppe., Cucinotta, Tommaso. (2010). The multiprocessor bandwidth inheritance protocol. In 22nd Euromicro Conference on Real-Time Systems, ECRTS’10 (pp. 90–99). IEEE Computer Society. doi:10.1109/ECRTS.2010.19.

[27] Faggioli, Dario, Lipari, Giuseppe., Cucinotta, Tommaso. (2012). Analysis and implementation of the multiprocessor bandwidth inheritance protocol. Real-Time Systems, 48(6), 789–825. doi:10.1007/s11241-012-9162-0.

[28] Gai, Paolo, Lipari, Giuseppe, & Di Natale, Marco. (2001). Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In 22nd IEEE Real-Time Systems Symposium, RTSS’01 (pp. 73–83). IEEE Computer Society. doi:10.1109/REAL.2001.990598.

[29] Gai, Paolo, Di Natale, Marco, Lipari, Giuseppe, Ferrari, Alberto, Gabellini, Claudio, & Marceca, Paolo. (2003). A comparison of MPCP and MSRP when sharing resources in the janus multiple-processor on a chip platform. In 9th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’03 2003) (p. 189). IEEE Computer Society. doi:10.1109/RTTAS.2003.1203051.

[25] Glenn A. Elliott and James H. Anderson. An optimal k-exclusion real-time locking protcol motivated by multi-gpu systems. In Sébastien Faucou, Alan Burns, and Laurent George, editors, 19th International Conference on Real-Time and Network Systems, RTNS’11, pages 15–24, September 2011. URL: http://rtns2011.irccyn.ec-nantes. fr/files/rtns2011.pdf.-

[26] Dario Faggioli, Giuseppe Lipari, and Tommaso Cucinotta. The multiprocessor bandwidth inheritance protocol. In 22nd Euromicro Conference on Real-Time Systems, ECRTS’10, pages 90–99. IEEE Computer Society, July 2010. doi:10.1109/ECRTS.2010.19.

[27] Dario Faggioli, Giuseppe Lipari, and Tommaso Cucinotta. Analysis and implementation of the multiprocessor bandwidth inheritance protocol. Real-Time Systems, 48(6):789–825, 2012. doi:10.1007/s11241-012-9162-0.

[28] Paolo Gai, Giuseppe Lipari, and Marco Di Natale. Minimizing memory utilization of real-time task sets in single and multi-processor systems-ona-chip. In 22nd IEEE Real-Time Systems Symposium, RTSS’01, pages 73–83. IEEE Computer Society, December 2001. doi:10.1109/REAL.2001. 990598.

[29] Paolo Gai., Marco Di Natale., Giuseppe Lipari., Alberto Ferrari., Claudio Gabellini., and Paolo Marceca. (2003). A comparison of MPCP and MSRP when sharing resources in the janus multiple-processor on a chip platform. In 9th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’03 2003), page 189. IEEE Computer Society, May 2003. doi:10.1109/RTTAS. 2003.1203051.

[30] Goossens, Joël., Funk, Shelby., Baruah, Sanjoy K. (2003). Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Systems, 25(2-3), 187–205. doi:10.1023/A:1025120124771.

[31] Hsiu, Pi-Cheng., Lee, Der-Nien., Kuo, Tei-Wei. (2011). Task synchronization and allocation for manycore real-time systems. In Samarjit Chakraborty, Ahmed Jerraya, Sanjoy K. Baruah, & Sebastian Fischmeister (Eds.), 11th International Conference on Embedded Software, EMSOFT’11 (pp. 79–88). ACM. doi:10.1145/2038642.2038656.

[32] Jin, Craig T. (1993). Queuing spin lock algorithms to support timing predictability. In Real-Time Systems Symposium (pp. 148–157). doi:10.1109/REAL.1993.393505.

[33] Johnson, Theodore., Harathi, Krishna. (1997). A prioritized multiprocessor spin lock. IEEE Transactions on Parallel and Distributed Systems, 8(9), 926–933. doi:10.1109/71.615438.

[34] Kopetz, Hermann., Ademaj, Astrit., Grillinger, Petr., Steinhammer, Klaus. (2005). The time-triggered Ethernet (TTE) design. In Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing ISORC’05 (pp. 22–33). IEEE Computer Society. doi:10.1109/ISORC.2005.56.

[35] Lakshmanan, Karthik., de Niz, Dionisio., Rajkumar, Ragunathan. (2009). Coordinated task scheduling, allocation and synchronization on multiprocessors. In Theodore P. Baker (Ed.), 30th IEEE Real-Time Systems Symposium, RTSS’09 (pp. 469–478). IEEE Computer Society. doi:10.1109/RTSS.2009.51.

[36] Lampson, Butler W., Redell, David D. (1980). Experience with processes and monitors in Mesa. Communications of the ACM, 23(2), 105–117. doi:10.1145/358818.358824.

[37] Liu, C. L., Layland, James W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), 46–61. doi:10.1145/321738.321743.

[38] Lortz, Victor B., Shin, Kang G. (1995). Semaphore queue priority assignment for real-time multiprocessor synchronization. IEEE Transactions on Software Engineering, 21(10), 834–844. doi:10.1109/32.469457.

[39] Lozi, Jean-Pierre., David, Florian., Thomas, Gaël., Lawall, Julia L., Muller, Gilles. (2012). Remote core locking: Migrating critical-section execution to improve the performance of multithreaded applications. In Gernot Heiser & Wilson C. Hsieh (Eds.), 2012 USENIX Annual Technical Conference (pp. 65–76). USENIX Association. Retrieved from https://www.usenix.org/conference/atc12/technical-sessions/presentation/lozi.

[40] Macariu, Georgiana., Cretu, Vladimir. (2011). Limited blocking resource sharing for global multiprocessor scheduling. In Karl-Erik Årzén (Ed.), 23rd Euromicro Conference on Real-Time Systems, ECRTS’11 (pp. 262–271). IEEE Computer Society. doi:10.1109/ECRTS.2011.32.

[41] Markatos, Evangelos P., LeBlanc, Thomas J. (1991). Multiprocessor synchronization primitives with priorities. In 8th IEEE Workshop on Real-Time Operating Systems and Software (pp. 1–7).

[42] Nemati, Farhang., Behnam, Moris., Nolte, Thomas. (2011). Independently-developed real-time systems on multi-cores with shared resources. In Karl-Erik Årzén (Ed.), 23rd Euromicro Conference on Real-Time Systems, ECRTS’11 (pp. 251–261). IEEE Computer Society. doi:10.1109/ECRTS.2011.31.

[43] Rajkumar, Ragunathan. (1990). Real-time synchronization protocols for shared memory multiprocessors. In 10th International Conference on Distributed Computing Systems, ICDCS’90 (pp. 116–123). IEEE Computer Society. doi:10.1109/ICDCS.1990.89257.

[44] Rajkumar, Ragunathan. (1991). Synchronization in Real-Time Systems: A Priority Inheritance Approach. Kluwer Academic Publishers.

[45] Rajkumar, Ragunathan., Sha, Lui., Lehoczky, John P. (1988). Real-time synchronization protocols for multiprocessors. In 9th IEEE Real-Time Systems Symposium, RTSS’88 (pp. 259–269). IEEE Computer Society. doi:10.1109/REAL.1988.51121.

[46] Ridouard, Frédéric., Richard, Pascal., Cottet, Francis. (2004). Negative results for scheduling independent hard real-time tasks with self-suspensions. In 25th IEEE Real-Time Systems Symposium, RTSS’04 (pp. 47–56). IEEE Computer Society. doi:10.1109/REAL.2004.35.

[47] Schliecker, Simon., Negrean, Mircea., Ernst, Rolf. (2009). Response time analysis in multicore ECUs with shared resources. IEEE Transactions on Industrial Informatics, 5(4), 402–413. doi:10.1109/TII.2009.2032068.

[48] Sha, Lui., Rajkumar, Ragunathan., Lehoczky, John P. (1990). Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9), 1175–1185. doi:10.1109/12.57058.

[49] Ward, Bryan C., Anderson, James H. (2012). Supporting nested locking in multiprocessor real-time systems. In Robert Davis (Ed.), 24th Euromicro Conference on Real-Time Systems, ECRTS’12 (pp. 223–232). IEEE Computer Society. doi:10.1109/ECRTS.2012.17.

[50] Ward, Bryan C., Elliott, Glenn A., Anderson, James H. (2012). Replica-request priority donation: A real-time progress mechanism for global locking protocols. In 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA’12 (pp. 280–289). IEEE Computer Society. doi:10.1109/RTCSA.2012.26.

[51] West, Richard., Li, Ye., Missimer, Eric S. (2012). Time management in the Quest-V RTOS. In 8th Annual Workshop on Operating Systems Platforms for Embedded Real-Time Applications. Retrieved from http://www.cs.bu.edu/fac/richwest/papers/questv-multicore.pdf.

[52] Wieder, Alexander., Brandenburg, Björn B. (2013). On spin locks in AUTOSAR: blocking analysis of FIFO, unordered, and priority-ordered spin locks. In IEEE 34th Real-Time Systems Symposium, RTSS’13 (pp. 45–56). IEEE. doi:10.1109/RTSS.2013.13.


Home | Aim & Scope | Editorial Board | Author Guidelines | Publisher | Subscription | Previous Issue | Contact Us |Upcoming Conferences|Sample Issues|Library Recommendation Form|

 

Copyright © 2011 dline.info