A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (Q4031320)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment |
scientific article; zbMATH DE number 148920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment |
scientific article; zbMATH DE number 148920 |
Statements
A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (English)
0 references
1 April 1993
0 references
schematic algorithm
0 references
distributed systems
0 references
randomized algorithm
0 references
consensus problem
0 references
message-passing model
0 references
processor renaming problem
0 references
shared-memory model
0 references
0.788483738899231
0 references
0.788483738899231
0 references
0.774695873260498
0 references
0.768902063369751
0 references
