Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Task synchronization and allocation for many-core real-time systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Resource sharing in RTSJ and SCJ systems
Proceedings of the 9th International Workshop on Java Technologies for Real-Time and Embedded Systems
Globally scheduled real-time multiprocessor systems with GPUs
Real-Time Systems
Ada 2012: resource sharing and multiprocessors
ACM SIGAda Ada Letters
Fine-grained multiprocessor real-time locking with improved blocking
Proceedings of the 21st International conference on Real-Time Networks and Systems
ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
Locking policies for multiprocessor ada
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
When locking protocols are used in real-time systems, bounds on blocking times are required when ensuring timing constraints. While the term “blocking” is well-understood in the context of uniprocessor real-time systems, the same is not true in the multiprocessor case. In this paper, two definitions of blocking are presented that are applicable to suspension-based multiprocessor locking protocols. The need for two definitions arises because of differences in how suspensions are handled in existing schedulability analysis. For each definition, locking protocols are presented that have asymptotically optimal blocking behavior. In particular, protocols are presented for any job-level static-priority global or partitioned scheduling algorithm.