More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems (Q1260652): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/inco.1993.1043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981017197 / rank | |||
Normal rank | |||
Latest revision as of 01:37, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems |
scientific article |
Statements
More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems (English)
0 references
30 August 1993
0 references
The paper defines the general consensus problem for protocols where each processor decides on a single value such that the set of decided values in any run is the size of a given set. The motivation for studying the problem is to test whether the number of choices allowed to the processors is related to the number of faults. The main result of the paper is the assumption of a totally asynchronous system that characterizes the boundary between possibility and impossibility of given multiple faults.
0 references
consensus problem
0 references
protocols
0 references
totally asynchronous system
0 references
