research-article

Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks

Authors:

Björn B. Brandenburg,

James H. AndersonAuthors Info & Claims

EMSOFT '11: Proceedings of the ninth ACM international conference on Embedded software

Pages 69 - 78

https://doi.org/10.1145/2038642.2038655

Published: 09 October 2011 Publication History

Abstract

This paper presents the first suspension-based real-time locking protocols for clustered schedulers. Such schedulers pose challenges from a locking perspective because they exhibit aspects of both partitioned and global scheduling, which seem to necessitate fundamentally different means for bounding priority inversions. A new mechanism to bound such inversions, termed priority donation, is presented and used to derive protocols for mutual exclusion, reader-writer exclusion, and k-exclusion. Each protocol has asymptotically optimal blocking bounds under certain analysis assumptions. The latter two protocols are also the first of their kind for the special cases of global and partitioned scheduling.

References

[1]

T. Baker. Stack-based scheduling for realtime processes. Real-Time Sys., 3(1):67--99, 1991.

Digital Library

[2]

T. Baker and S. Baruah. Schedulability analysis of multiprocessor sporadic task systems. In Handbook of Real-Time and Embedded Sys., Chapman Hall/CRC, Boca Raton, Florida, 2007.

[3]

S. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, and S. Stiller. Improved multiprocessor global schedulability analysis. Real-Time Sys., 46(1):3--24, 2010.

Digital Library

[4]

A. Bastoni, B. Brandenburg, and J. Anderson. An empirical comparison of global, partitioned, and clustered multiprocessor real-time schedulers. In Proc. RTSS, 2010.

Digital Library

[5]

A. Block, H. Leontyev, B. Brandenburg, and J. Anderson. A flexible real-time locking protocol for multiprocessors. In Proc. RTCSA, 2007.

Digital Library

[6]

B. Brandenburg and J. Anderson. A comparison of the M-PCP, D-PCP, and FMLP on Litmus™. In Proc. OPODIS, 2008.

Digital Library

[7]

B. Brandenburg and J. Anderson. An implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP real-time synchronization protocols in Litmus™, In Proc. RTCSA, 2008.

Digital Library

[8]

B. Brandenburg and J. Anderson. Optimality results for multiprocessor real-time locking. In Proc. RTSS, 2010.

Digital Library

[9]

B. Brandenburg and J. Anderson. Spin-based reader-writer synchronization for multiprocessor real-time systems. Real-Time Sys., 46(1):25--87, 2010.

Digital Library

[10]

B. Brandenburg, J. Calandrino, A. Block, H. Leontyev, and J. Anderson. Synchronization on real-time multiprocessors: To block or not to block, to suspend or spin? In Proc. RTAS, 2008.

Digital Library

[11]

J. Calandrino, J. Anderson, and D. Baumberger. A hybrid real-time scheduling approach for large-scale multicore platforms. In Proc. ECRTS, 2007.

Digital Library

[12]

J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, and S. Baruah. A categorization of real-time multiprocessor scheduling problems and algorithms. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman and Hall/CRC, 2004.

[13]

C. Chen and S. Tripathi. Multiprocessor priority ceiling based protocols. Technical Report CS-TR-3252, Univ. of Maryland, 1994.

Digital Library

[14]

A. Easwaran and B. Andersson. Resource sharing in global fixed-priority preemptive multiprocessor scheduling. In Proc. RTSS, 2009.

Digital Library

[15]

Dario Faggioli, Giuseppe Lipari, and Tommaso Cucinotta. The multiprocessor bandwidth inheritance protocol. In Proc. ECRTS, 2010.

Digital Library

[16]

P. Gai, M. di Natale, G. Lipari, A. Ferrari, C. Gabellini, and P. Marceca. A comparison of MPCP and MSRP when sharing resources in the Janus multiple processor on a chip platform. In Proc. RTAS, 2003.

Digital Library

[17]

K. Lakshmanan, D. Niz, and R. Rajkumar. Coordinated task scheduling, allocation and synchronization on multiprocessors. In Proc. RTSS, 2009.

Digital Library

[18]

R. Rajkumar. Real-time synchronization protocols for shared memory multiprocessors. In Proc. ICDCS, 1990.

[19]

R. Rajkumar. Synchronization In Real-Time Sys. - A Priority Inheritance Approach. Kluwer Academic Publishers, 1991.

Digital Library

[20]

R. Rajkumar, L. Sha, and J. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proc. RTSS, 1988.

[21]

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

Digital Library

Cited By

Brandenburg B(2022)Multiprocessor Real-Time Locking ProtocolsHandbook of Real-Time Computing10.1007/978-981-287-251-7_10(347-446)Online publication date: 9-Aug-2022
https://doi.org/10.1007/978-981-287-251-7_10
Shi JUeter NBruggen GChen J(2021)Graph-Based Optimizations for Multiprocessor Nested Resource Sharing2021 IEEE 27th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)10.1109/RTCSA52859.2021.00023(129-138)Online publication date: Aug-2021
https://doi.org/10.1109/RTCSA52859.2021.00023
Nemitz CAmert TGoyal MAnderson J(2021)Concurrency groups: a new way to look at real-time multiprocessor lock nestingReal-Time Systems10.1007/s11241-020-09361-0Online publication date: 5-Feb-2021
https://doi.org/10.1007/s11241-020-09361-0
Show More Cited By

Index Terms

Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management

Recommendations

The OMLP family of optimal multiprocessor real-time locking protocols

This paper presents the first suspension-based multiprocessor real-time locking protocols with asymptotically optimal blocking bounds (under certain analysis assumptions). These protocols can be applied under any global, clustered, or partitioned job-...
Abortable reader-writer locks are no more complex than abortable mutex locks
DISC'12: Proceedings of the 26th international conference on Distributed Computing

When a process attempts to acquire a mutex lock, it may be forced to wait if another process currently holds the lock. In certain applications, such as real-time operating systems and databases, indefinite waiting can cause a process to miss an ...
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneously access the shared resource. We present the first known shared-memory k-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

EMSOFT '11: Proceedings of the ninth ACM international conference on Embedded software

October 2011

366 pages

ISBN:9781450307147

DOI:10.1145/2038642

General Chairs:
Samarjit Chakraborty
TU Munich
,
Ahmed Jerraya
CEA
,
Program Chairs:
Sanjoy Baruah
University of North Carolina at Chapel Hill
,
Sebastian Fischmeister
University of Waterloo

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 October 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ESWeek '11

Sponsor:

ESWeek '11: Seventh Embedded Systems Week

October 9 - 14, 2011

Taipei, Taiwan

Acceptance Rates

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
191
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Brandenburg B(2022)Multiprocessor Real-Time Locking ProtocolsHandbook of Real-Time Computing10.1007/978-981-287-251-7_10(347-446)Online publication date: 9-Aug-2022
https://doi.org/10.1007/978-981-287-251-7_10
Shi JUeter NBruggen GChen J(2021)Graph-Based Optimizations for Multiprocessor Nested Resource Sharing2021 IEEE 27th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)10.1109/RTCSA52859.2021.00023(129-138)Online publication date: Aug-2021
https://doi.org/10.1109/RTCSA52859.2021.00023
Nemitz CAmert TGoyal MAnderson J(2021)Concurrency groups: a new way to look at real-time multiprocessor lock nestingReal-Time Systems10.1007/s11241-020-09361-0Online publication date: 5-Feb-2021
https://doi.org/10.1007/s11241-020-09361-0
Talmale GShrawankar U(2021)Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor systemConcurrency and Computation: Practice and Experience10.1002/cpe.643833:21Online publication date: 4-Jun-2021
https://doi.org/10.1002/cpe.6438
Nemitz CAmert TAnderson J(2019)Real-time multiprocessor locks with nestingReal-Time Systems10.1007/s11241-019-09328-w55:2(296-348)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s11241-019-09328-w
Brandenburg B(2019)Multiprocessor Real-Time Locking ProtocolsHandbook of Real-Time Computing10.1007/978-981-4585-87-3_10-1(1-99)Online publication date: 15-Nov-2019
https://doi.org/10.1007/978-981-4585-87-3_10-1
Patel PBaek IKim HRajkumar R(2018)Analytical Enhancements and Practical Insights for MPCP with Self-Suspensions2018 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2018.00027(177-189)Online publication date: Apr-2018
https://doi.org/10.1109/RTAS.2018.00027
Rabee FOnaizah AMahdi A(2017)Shift-exchange Synchronization Protocol(SESP) in hard real time system2017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)10.1109/IAEAC.2017.8054026(304-310)Online publication date: Mar-2017
https://doi.org/10.1109/IAEAC.2017.8054026
Nemitz CYang KYang MEkberg PAnderson J(2016)Multiprocessor Real-Time Locking Protocols for Replicated Resources2016 28th Euromicro Conference on Real-Time Systems (ECRTS)10.1109/ECRTS.2016.29(50-60)Online publication date: Jul-2016
https://doi.org/10.1109/ECRTS.2016.29
Jarrett CWard BAnderson JForget J(2015)A contention-sensitive fine-grained locking protocol for multiprocessor real-time systemsProceedings of the 23rd International Conference on Real Time and Networks Systems10.1145/2834848.2834874(3-12)Online publication date: 4-Nov-2015
https://dl.acm.org/doi/10.1145/2834848.2834874
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten