Power and limits of distributed computing shared memory models (Q392187)
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 6244715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Power and limits of distributed computing shared memory models |
scientific article; zbMATH DE number 6244715 |
Statements
Power and limits of distributed computing shared memory models (English)
0 references
13 January 2014
0 references
adversary
0 references
agreement
0 references
asynchronous system
0 references
Borowsky-Gafni (BG) simulation
0 references
concurrency
0 references
crash failure
0 references
distributed computability
0 references
distributed computing model
0 references
failure detector
0 references
fault-tolerance
0 references
iterated model
0 references
liveness
0 references
model equivalence
0 references
recursion
0 references
resilience
0 references
shared-memory system
0 references
snapshot
0 references
task
0 references
topology
0 references
wait-freedom
0 references
0 references
0 references
0 references
0 references
0.8191236853599548
0 references
0.8128597140312195
0 references
0.8024886846542358
0 references
0.8017327189445496
0 references
