(2011) Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks.
In: 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).
Conference:
EMSOFT ACM Conference on Embedded Software
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.
| Item Type: | Conference or Workshop Item (A Paper) (Paper) |
|---|---|
| Uncontrolled Keywords: | resource allocation;scheduling;bounding priority inversion;clustered scheduling;global scheduling;k-exclusion locks;locking perspective;mutual exclusion;partitioned scheduling;priority donation;reader-writer exclusion;real-time resource-sharing;suspension-based real-time locking protocol;Boosting;Delay;Processor scheduling;Protocols;Real time systems;Scheduling;Suspensions;Algorithms;Performance;Verification |
| Conference: | EMSOFT ACM Conference on Embedded Software |
| Depositing User: | Andreas Rau |
| Date Deposited: | 22 Feb 2018 10:43 |
| Last Modified: | 22 Feb 2018 12:11 |
| URI: | https://publications.cispa.saarland/id/eprint/1539 |
Actions
Actions (login required)
 |
View Item |