Time-space tradeoffs for implementations of snapshots (Q2931381)
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 6373888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space tradeoffs for implementations of snapshots |
scientific article; zbMATH DE number 6373888 |
Statements
Time-space tradeoffs for implementations of snapshots (English)
0 references
25 November 2014
0 references
anonymous processes
0 references
distributed computing
0 references
lower bound
0 references
shared memory
0 references
snapshot
0 references
time-space tradeoff
0 references
wait-free
0 references
0.8781895
0 references
0.8780293
0 references
0.87608176
0 references
0.87153697
0 references
0.87126094
0 references
0.8696934
0 references
0.8630433
0 references
0 references
