Lower and upper bounds for single-scanner snapshot implementations (Q2401677)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6769038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds for single-scanner snapshot implementations |
scientific article; zbMATH DE number 6769038 |
Statements
Lower and upper bounds for single-scanner snapshot implementations (English)
0 references
4 September 2017
0 references
snapshots
0 references
single-scanner
0 references
multi-writer
0 references
atomic objects
0 references
wait-freedom
0 references
linearizability
0 references
asynchronous
0 references
distributed algorithms
0 references
shared memory
0 references
step optimal algorithms
0 references
0.8878896236419678
0 references
0.8806409239768982
0 references
0.852835476398468
0 references
0.8518953323364258
0 references
0.8293982148170471
0 references
