Abstract—A fine-grained locking protocol permits multiple locks to be held simultaneously by the same task. In the case of real-time multiprocessor systems, prior work on such protocols has considered only mutex constraints. This unacceptably limits concurrency in systems in which some resource accesses are read-only. To remedy this situation, a variant of a recently proposed fine-grained protocol called the real-time nested locking protocol (RNLP) is presented that enables concurrent reads. This variant is shown to have worst-case blocking no worse (and often better) than existing coarse-grained real-time reader/writer locking protocols, while allowing for additional parallelism. Experimental evaluations of the proposed protocol are presen...
Most multiprocessors are multiprogrammed to achieve accept-able response time. Unfortunately, inoppo...
Multicore platforms are becoming increasingly popular in real-time systems. One of the major challen...
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...
Existing multiprocessor real-time locking protocols that sup-port nesting are subject to adverse blo...
We systematically survey the literature on analytically sound multiprocessor real-time locking proto...
Prior work on multiprocessor real-time locking protocols has shown how to support fine-grained lock ...
Reader preference, writer preference, and task-fair reader-writer locks are shown to cause undue blo...
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is pres...
With the widespread adoption of multicore architectures, multiprocessors are now a standard deployme...
Data sharing among tasks within multiprocessor real-time systems is a crucial issue. This report pre...
This paper is directed at reader/writer locking for read-dominant real-time workloads. It is shown t...
Most multiprocessors are multiprogrammed in order to achieve acceptable response time and to increas...
We present a fast and scalable lock algorithm for shared-memory multiprocessors addressing the resou...
During the past decade, parallelism-related issues have been at the forefront of real-time systems r...
Link to published version: http://ieeexplore.ieee.org/iel3/4440/12600/00580906.pdf?tp=&arnumber=5809...
Most multiprocessors are multiprogrammed to achieve accept-able response time. Unfortunately, inoppo...
Multicore platforms are becoming increasingly popular in real-time systems. One of the major challen...
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...
Existing multiprocessor real-time locking protocols that sup-port nesting are subject to adverse blo...
We systematically survey the literature on analytically sound multiprocessor real-time locking proto...
Prior work on multiprocessor real-time locking protocols has shown how to support fine-grained lock ...
Reader preference, writer preference, and task-fair reader-writer locks are shown to cause undue blo...
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is pres...
With the widespread adoption of multicore architectures, multiprocessors are now a standard deployme...
Data sharing among tasks within multiprocessor real-time systems is a crucial issue. This report pre...
This paper is directed at reader/writer locking for read-dominant real-time workloads. It is shown t...
Most multiprocessors are multiprogrammed in order to achieve acceptable response time and to increas...
We present a fast and scalable lock algorithm for shared-memory multiprocessors addressing the resou...
During the past decade, parallelism-related issues have been at the forefront of real-time systems r...
Link to published version: http://ieeexplore.ieee.org/iel3/4440/12600/00580906.pdf?tp=&arnumber=5809...
Most multiprocessors are multiprogrammed to achieve accept-able response time. Unfortunately, inoppo...
Multicore platforms are becoming increasingly popular in real-time systems. One of the major challen...
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...