Name
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 presented that consider both schedulability (i.e., the ability to validate timing constraints) and implementation-related overheads. These evaluations demonstrate that the RNLP (both the mutex and the proposed reader/writer variant) provides improved schedulability over existing coarse-grained locking protocols, and is practically implementable. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/IPDPS.2014.29 | Phoenix, AZ |
Keywords | DocType | ISSN |
concurrency control,microprocessor chips,multiprocessing systems,protocols,real-time systems,RNLP,coarse-grained real-time reader-writer locking protocols,fine-grained locking protocol,implementation-related overheads,multiresource real-time reader-writer locks,mutex constraints,real-time multiprocessor systems,real-time nested locking protocol,schedulability,worst-case blocking,priority inversion,reader-writer exclusion,real-time,real-time synchronization | Conference | 1530-2075 |
Citations | PageRank | References |
3 | 0.42 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bryan C. Ward | 1 | 3 | 0.42 |
| James H. Anderson | 2 | 3 | 0.42 |