The time complexity of updating snapshot memories (Q293175): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M14 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590660 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
snapshot memory | |||
| Property / zbMATH Keywords: snapshot memory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
distributed protocol | |||
| Property / zbMATH Keywords: distributed protocol / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fault tolerance | |||
| Property / zbMATH Keywords: fault tolerance / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
lower bound | |||
| Property / zbMATH Keywords: lower bound / rank | |||
Normal rank | |||
Revision as of 20:15, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The time complexity of updating snapshot memories |
scientific article |
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
