Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160)
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: Emulating shared-memory do-all algorithms in asynchronous message-passing systems |
scientific article; zbMATH DE number 6012859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Emulating shared-memory do-all algorithms in asynchronous message-passing systems |
scientific article; zbMATH DE number 6012859 |
Statements
Emulating shared-memory do-all algorithms in asynchronous message-passing systems (English)
0 references
7 March 2012
0 references
distributed algorithm
0 references
fault-tolerance
0 references
work
0 references
communication
0 references
quorums
0 references
0 references
0 references
0.89121675
0 references
0.8856702
0 references
0.8791739
0 references
