One-shot definition
One-shot means that a process invokes propose() at most once. When a process invokes propose(v), we say that it “proposes v”. When the invocation of propose() returns value v, we say that the invoking process “decides v”. A process executes “solo” when it keeps on executing while the other processes have stopped their execution (at any point of their algorithm). The obstruction-free consensus problem is defined by the following properties (that is, to be correct, any obstruction-free algorithm must satisfy these properties).
One-shot means that a process invokes propose() at most once. When a process invokes propose(v), we say that it “proposes v”. When the invocation of propose() returns value v′, we say that the invoking process “decides v′”. A process executes “solo” when it keeps on executing while the other processes have stopped their execution (at any point of their algorithm). In the context of the obstruction-free progress condition (see below the OF-termination property), the consensus problem (consequently called obstruction-free consensus) is defined by the following properties (that is, to be correct, any obstruction-free algorithm must satisfy such properties). • Validity. If a process decides a value, this value was proposed by a process. • Agreement. No two processes decide different values. • OF-termination. If there is a time after which a correct process executes solo, it decides a value. • SV-termination. If a single value is proposed, all correct processes decide. Validity relates outputs to inputs. Agreement relates the outputs. Termination states the conditions under which a correct process must decide. There are two cases. The first is related to obstruction-freedom. The second one is independent of the concurrency and failure pattern; it is related to the input value pattern 2. Obstruction-free (n, k)-set agreement An obstruction-free (n, k)-set agreement object is a one-shot object which has the same validity, OF-termination, and SV-termination properties as consensus, and for which we replace the agreement property with: • Agreement. At most k different values are decided.
One-shot calculation, which means that the odd-frequency
More Definitions of One-shot
One-shot means that, given such an ob- ject,a process can invoke that operation at most once (there is no reset operation). The invocations on such an object satisfy the following properties: •