Existing multiprocessor real-time locking protocols that sup-port nesting are subject to adverse blocking that can be avoided when additional resource-usage-pattern information is known. These sources of blocking stem from system over-heads, varying critical section lengths, and a lack of sup-port for replicated resources. In this paper, these issues are resolved in the context of the recently proposed real-time nested locking protocol (RNLP). The resulting protocols are the first to support fine-grained real-time lock nesting while allowing multiple resources to be locked in one atomic op-eration, both spin- and suspension-based waiting to be used together, and resources to be replicated. They also reduce “short-on-long ” blocking, which i...
Lower and upper bounds on the maximum prior-ity inversion blocking (pi-blocking) that is gener-ally ...
Real-time scheduling algorithms for multiprocessor systems have been the subject of considerable rec...
Bounding worst-case blocking delays due to lock contention is a fundamental problem in the analysis ...
Existing multiprocessor real-time locking protocols that sup-port nesting are subject to adverse blo...
Abstract—A fine-grained locking protocol permits multiple locks to be held simultaneously by the sam...
Prior work on multiprocessor real-time locking protocols has shown how to support fine-grained lock ...
We systematically survey the literature on analytically sound multiprocessor real-time locking proto...
During the past decade, parallelism-related issues have been at the forefront of real-time systems r...
Various approaches can be utilized upon resource locking for mutually exclusive resource access in m...
Existing real-time locking protocols require accurate worst-case execution time (WCET) estimates for...
With the widespread adoption of multicore architectures, multiprocessors are now a standard deployme...
Computing devices are increasingly being leveraged in cyber-physical systems, in which computing dev...
During the past decade, parallelism-related issues have been at the forefront of real-time systems r...
International audienceWe present in this paper a new lock-based resource sharing protocol PWLP (Pree...
Multicore platforms are becoming increasingly popular in real-time systems. One of the major challen...
Lower and upper bounds on the maximum prior-ity inversion blocking (pi-blocking) that is gener-ally ...
Real-time scheduling algorithms for multiprocessor systems have been the subject of considerable rec...
Bounding worst-case blocking delays due to lock contention is a fundamental problem in the analysis ...
Existing multiprocessor real-time locking protocols that sup-port nesting are subject to adverse blo...
Abstract—A fine-grained locking protocol permits multiple locks to be held simultaneously by the sam...
Prior work on multiprocessor real-time locking protocols has shown how to support fine-grained lock ...
We systematically survey the literature on analytically sound multiprocessor real-time locking proto...
During the past decade, parallelism-related issues have been at the forefront of real-time systems r...
Various approaches can be utilized upon resource locking for mutually exclusive resource access in m...
Existing real-time locking protocols require accurate worst-case execution time (WCET) estimates for...
With the widespread adoption of multicore architectures, multiprocessors are now a standard deployme...
Computing devices are increasingly being leveraged in cyber-physical systems, in which computing dev...
During the past decade, parallelism-related issues have been at the forefront of real-time systems r...
International audienceWe present in this paper a new lock-based resource sharing protocol PWLP (Pree...
Multicore platforms are becoming increasingly popular in real-time systems. One of the major challen...
Lower and upper bounds on the maximum prior-ity inversion blocking (pi-blocking) that is gener-ally ...
Real-time scheduling algorithms for multiprocessor systems have been the subject of considerable rec...
Bounding worst-case blocking delays due to lock contention is a fundamental problem in the analysis ...