Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks (Q4909418)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks |
scientific article; zbMATH DE number 6144223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks |
scientific article; zbMATH DE number 6144223 |
Statements
Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks (English)
0 references
13 March 2013
0 references
concurrent algorithm
0 references
synchronization
0 references
reader-writer exclusion
0 references
mutual exclusion
0 references
abortability
0 references
RMR complexity
0 references
shared-memory algorithm
0 references
0.8249597
0 references
0.78491205
0 references
0.77700186
0 references
0.7709836
0 references
0 references
0.7578815
0 references
