Abstract—Multiprocessor real-time locking protocols that are asymptotically optimal under suspension-oblivious schedulability analysis (where suspensions are pessimistically modeled as pro-cessor demand) are known for partitioned, global, and clustered job-level fixed priority (JLFP) scheduling. However, for the case of more accurate suspension-aware schedulability analysis (where suspensions are accounted for explicitly), asymptotically optimal protocols are known only for partitioned JLFP scheduling. In this paper, the gap is closed with the introduction of the first semaphore protocol for suspension-aware analysis that is asymptotically opti-mal under global and clustered JLFP scheduling. To this end, a new progress mechanism that avoids...
We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propos...
In global real-time multiprocessor scheduling, a recent analysis technique for Task-level Fixed-Prio...
In this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks ...
Lower and upper bounds on the maximum prior-ity inversion blocking (pi-blocking) that is gener-ally ...
Real-time locking protocols are typically designed to reduce any priority-inversion blocking (pi-blo...
This paper presents the first suspension-based real-time locking protocols for clustered schedulers....
With the widespread adoption of multicore architectures, multiprocessors are now a standard deployme...
This paper presents the Fixed Priority until Critical Laxity (FPCL) and Fixed Priority until Zero La...
Motivated by the lack of response-time analyses for non-preemptive global scheduling that consider s...
Prior work has produced multiprocessor real-time locking protocols that ensure asymptotically optima...
Prior work on multiprocessor real-time locking protocols has shown how to support fine-grained lock ...
Prior work has produced multiprocessor real-time locking protocols that ensure asymptotically optima...
Bounding worst-case blocking delays due to lock contention is a fundamental problem in the analysis ...
Abstract. The Priority Ceiling Protocol (PCP) of Sha, Rajkumar nd Lehoczky is a policy for locking b...
Recent trends in System-on-a-Chip show that an increasing number of special-purpose processors are b...
We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propos...
In global real-time multiprocessor scheduling, a recent analysis technique for Task-level Fixed-Prio...
In this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks ...
Lower and upper bounds on the maximum prior-ity inversion blocking (pi-blocking) that is gener-ally ...
Real-time locking protocols are typically designed to reduce any priority-inversion blocking (pi-blo...
This paper presents the first suspension-based real-time locking protocols for clustered schedulers....
With the widespread adoption of multicore architectures, multiprocessors are now a standard deployme...
This paper presents the Fixed Priority until Critical Laxity (FPCL) and Fixed Priority until Zero La...
Motivated by the lack of response-time analyses for non-preemptive global scheduling that consider s...
Prior work has produced multiprocessor real-time locking protocols that ensure asymptotically optima...
Prior work on multiprocessor real-time locking protocols has shown how to support fine-grained lock ...
Prior work has produced multiprocessor real-time locking protocols that ensure asymptotically optima...
Bounding worst-case blocking delays due to lock contention is a fundamental problem in the analysis ...
Abstract. The Priority Ceiling Protocol (PCP) of Sha, Rajkumar nd Lehoczky is a policy for locking b...
Recent trends in System-on-a-Chip show that an increasing number of special-purpose processors are b...
We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propos...
In global real-time multiprocessor scheduling, a recent analysis technique for Task-level Fixed-Prio...
In this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks ...