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

Authors:
Björn B. Brandenburg;James H. Anderson
Affiliations:
University of North Carolina at Chapel Hill, Chapel Hill, NC, USA;University of North Carolina at Chapel Hill, Chapel Hill, NC, USA
Venue:
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Year:
2011

Citing 17
Cited 6

Stack-based scheduling for realtime processes

Real-Time Systems
Multiprocessor priority ceiling based protocols

Multiprocessor priority ceiling based protocols
Synchronization in Real-Time Systems: A Priority Inheritance Approach

Synchronization in Real-Time Systems: A Priority Inheritance Approach
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
A comparison of MPCP and MSRP when sharing resources in the Janus multiple-processor on a chip platform

RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms

ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
A Flexible Real-Time Locking Protocol for Multiprocessors

RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP Real-Time Synchronization Protocols in LITMUS^RT

RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Real-Time Synchronization on Multiprocessors: To Block or Not to Block, to Suspend or Spin?

RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
A Comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling

RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Coordinated Task Scheduling, Allocation and Synchronization on Multiprocessors

RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Spin-based reader-writer synchronization for multiprocessor real-time systems

Real-Time Systems
Improved multiprocessor global schedulability analysis

Real-Time Systems
The Multiprocessor Bandwidth Inheritance Protocol

ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Optimality Results for Multiprocessor Real-Time Locking

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium

Resource sharing in RTSJ and SCJ systems

Proceedings of the 9th International Workshop on Java Technologies for Real-Time and Embedded Systems
An optimal k-exclusion real-time locking protocol motivated by multi-GPU systems

Real-Time Systems
Ada 2012: resource sharing and multiprocessors

ACM SIGAda Ada Letters
Resource sharing among real-time components under multiprocessor clustered scheduling

Real-Time Systems
Fine-grained multiprocessor real-time locking with improved blocking

Proceedings of the 21st International conference on Real-Time Networks and Systems
Locking policies for multiprocessor ada

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

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.