An algorithm for the asynchronous Write-All problem based on process collision (Q5138352): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Algorithms with Processor Failures and Delays / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient parallel algorithms can be made robust / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4344152 / rank | |||
Normal rank | |||
Latest revision as of 03:00, 24 July 2024
scientific article; zbMATH DE number 7281840
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the asynchronous Write-All problem based on process collision |
scientific article; zbMATH DE number 7281840 |
Statements
An algorithm for the asynchronous Write-All problem based on process collision (English)
0 references
3 December 2020
0 references
