The time complexity of updating snapshot memories (Q293175)
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 6590660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The time complexity of updating snapshot memories |
scientific article; zbMATH DE number 6590660 |
Statements
The time complexity of updating snapshot memories (English)
0 references
9 June 2016
0 references
snapshot memory
0 references
distributed protocol
0 references
fault tolerance
0 references
lower bound
0 references
0.8365542888641357
0 references
0.8336851000785828
0 references
0.8290215730667114
0 references
0.8277804255485535
0 references
0.8277804255485535
0 references
