Matches in SemOpenAlex for { <https://semopenalex.org/work/W1497249813> ?p ?o ?g. }
- W1497249813 endingPage "196" @default.
- W1497249813 startingPage "182" @default.
- W1497249813 abstract "The k-set agreement problem is a generalization of the consensus problem: considering a system made up of n processes where each process proposes a value, each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. It has recently be shown that, in the crash failure model, min $(lfloor frac{f}{k} rfloor+2,lfloor frac{t}{k} rfloor +1)$ is a lower bound on the number of rounds for the non-faulty processes to decide (where t is an upper bound on the number of process crashes, and f, 0 ≤f ≤t, the actual number of crashes). This paper considers the k-set agreement problem in synchronous systems where up to t < n /2 processes can experience general omission failures (i.e., a process can crash or omit sending or receiving messages). It first introduces a new property, called strong termination. This property is on the processes that decide. It is satisfied if, not only every non-faulty process, but any process that neither crashes nor commits receive omission failures decides. The paper then presents a k-set agreement protocol that enjoys the following features. First, it is strongly terminating (to our knowledge, it is the first agreement protocol to satisfy this property, whatever the failure model considered). Then, it is early deciding and stopping in the sense that a process that either is non-faulty or commits only send omission failures decides and halts by round min $(lfloor frac{f}{k} rfloor+2,lfloor frac{t}{k} rfloor +1)$ . To our knowledge, this is the first early deciding k-set agreement protocol for the general omission failure model. Moreover, the protocol provides also the following additional early stopping property: a process that commits receive omission failures (and does not crash) executes at most min $(lceil frac{f}{k} rceil +2,lfloor frac{t}{k} rfloor +1)$ rounds. It is worth noticing that the protocol allows each property (strong termination vs early deciding/stopping vs early stopping) not to be obtained at the detriment of the two others. The combination of the fact that min $(lfloor frac{f}{k} rfloor+2,lfloor frac{t}{k} rfloor +1)$ is lower bound on the number of rounds in the crash failure model, and the very existence of the proposed protocol has two very interesting consequences. First, it shows that, although general omission failure model is more severe than the crash failure model, both models have the same lower bound for the non-faulty processes to decide. Second, it shows that, in the general omission failure model, that bound applies also the processes that commit only send omission failures." @default.
- W1497249813 created "2016-06-24" @default.
- W1497249813 creator A5001545243 @default.
- W1497249813 creator A5044347404 @default.
- W1497249813 creator A5047941433 @default.
- W1497249813 date "2006-01-01" @default.
- W1497249813 modified "2023-10-18" @default.
- W1497249813 title "Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures" @default.
- W1497249813 cites W1503184445 @default.
- W1497249813 cites W1568438553 @default.
- W1497249813 cites W1965964835 @default.
- W1497249813 cites W1967858331 @default.
- W1497249813 cites W1980697798 @default.
- W1497249813 cites W1981017197 @default.
- W1497249813 cites W1996730563 @default.
- W1497249813 cites W2001757616 @default.
- W1497249813 cites W2002477558 @default.
- W1497249813 cites W2017263659 @default.
- W1497249813 cites W2024624176 @default.
- W1497249813 cites W2027569465 @default.
- W1497249813 cites W2035362408 @default.
- W1497249813 cites W2038719275 @default.
- W1497249813 cites W2039164882 @default.
- W1497249813 cites W2056910803 @default.
- W1497249813 cites W2058777482 @default.
- W1497249813 cites W2065110409 @default.
- W1497249813 cites W2077963177 @default.
- W1497249813 cites W2101712143 @default.
- W1497249813 cites W2122491152 @default.
- W1497249813 cites W2126924915 @default.
- W1497249813 cites W2149907923 @default.
- W1497249813 cites W2160045145 @default.
- W1497249813 cites W2569772192 @default.
- W1497249813 cites W4251986490 @default.
- W1497249813 doi "https://doi.org/10.1007/11780823_15" @default.
- W1497249813 hasPublicationYear "2006" @default.
- W1497249813 type Work @default.
- W1497249813 sameAs 1497249813 @default.
- W1497249813 citedByCount "5" @default.
- W1497249813 crossrefType "book-chapter" @default.
- W1497249813 hasAuthorship W1497249813A5001545243 @default.
- W1497249813 hasAuthorship W1497249813A5044347404 @default.
- W1497249813 hasAuthorship W1497249813A5047941433 @default.
- W1497249813 hasConcept C111472728 @default.
- W1497249813 hasConcept C11413529 @default.
- W1497249813 hasConcept C114614502 @default.
- W1497249813 hasConcept C118615104 @default.
- W1497249813 hasConcept C119857082 @default.
- W1497249813 hasConcept C134306372 @default.
- W1497249813 hasConcept C138885662 @default.
- W1497249813 hasConcept C142724271 @default.
- W1497249813 hasConcept C159333733 @default.
- W1497249813 hasConcept C177148314 @default.
- W1497249813 hasConcept C177264268 @default.
- W1497249813 hasConcept C183469790 @default.
- W1497249813 hasConcept C189950617 @default.
- W1497249813 hasConcept C199360897 @default.
- W1497249813 hasConcept C204787440 @default.
- W1497249813 hasConcept C2776291640 @default.
- W1497249813 hasConcept C2780385302 @default.
- W1497249813 hasConcept C33923547 @default.
- W1497249813 hasConcept C41008148 @default.
- W1497249813 hasConcept C71924100 @default.
- W1497249813 hasConcept C77553402 @default.
- W1497249813 hasConcept C98045186 @default.
- W1497249813 hasConceptScore W1497249813C111472728 @default.
- W1497249813 hasConceptScore W1497249813C11413529 @default.
- W1497249813 hasConceptScore W1497249813C114614502 @default.
- W1497249813 hasConceptScore W1497249813C118615104 @default.
- W1497249813 hasConceptScore W1497249813C119857082 @default.
- W1497249813 hasConceptScore W1497249813C134306372 @default.
- W1497249813 hasConceptScore W1497249813C138885662 @default.
- W1497249813 hasConceptScore W1497249813C142724271 @default.
- W1497249813 hasConceptScore W1497249813C159333733 @default.
- W1497249813 hasConceptScore W1497249813C177148314 @default.
- W1497249813 hasConceptScore W1497249813C177264268 @default.
- W1497249813 hasConceptScore W1497249813C183469790 @default.
- W1497249813 hasConceptScore W1497249813C189950617 @default.
- W1497249813 hasConceptScore W1497249813C199360897 @default.
- W1497249813 hasConceptScore W1497249813C204787440 @default.
- W1497249813 hasConceptScore W1497249813C2776291640 @default.
- W1497249813 hasConceptScore W1497249813C2780385302 @default.
- W1497249813 hasConceptScore W1497249813C33923547 @default.
- W1497249813 hasConceptScore W1497249813C41008148 @default.
- W1497249813 hasConceptScore W1497249813C71924100 @default.
- W1497249813 hasConceptScore W1497249813C77553402 @default.
- W1497249813 hasConceptScore W1497249813C98045186 @default.
- W1497249813 hasLocation W14972498131 @default.
- W1497249813 hasOpenAccess W1497249813 @default.
- W1497249813 hasPrimaryLocation W14972498131 @default.
- W1497249813 hasRelatedWork W196405095 @default.
- W1497249813 hasRelatedWork W2042269609 @default.
- W1497249813 hasRelatedWork W2043525791 @default.
- W1497249813 hasRelatedWork W2108149667 @default.
- W1497249813 hasRelatedWork W2156058221 @default.
- W1497249813 hasRelatedWork W2409898308 @default.
- W1497249813 hasRelatedWork W2743273005 @default.
- W1497249813 hasRelatedWork W285605535 @default.