The complexity of obstruction-free implementations (Q3452220)
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: The complexity of obstruction-free implementations |
scientific article; zbMATH DE number 6507202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of obstruction-free implementations |
scientific article; zbMATH DE number 6507202 |
Statements
The complexity of obstruction-free implementations (English)
0 references
11 November 2015
0 references
shared memory
0 references
lower bounds
0 references
memory contention
0 references
perturbable objects
0 references
solo-fast implementations
0 references
step contention
0 references
0.8956522345542908
0 references
0.8349301815032959
0 references
0.811843991279602
0 references
0.793079137802124
0 references
0.7815452218055725
0 references
