Using asynchrony and zero degradation to speed up indulgent consensus protocols (Q436832): Difference between revisions

@@ Property / Wikidata QID @@
+Q60249867
@@ Property / Wikidata QID: Q60249867 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jpdc.2008.02.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2093912643
@@ Property / OpenAlex ID: W2093912643 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398822
@@ Property / cites work: Q4398822 / rank @@
+Normal rank
@@ Property / cites work @@
+The weakest failure detector for solving consensus
+Normal rank
@@ Property / cites work @@
+Unreliable failure detectors for reliable distributed systems
+Normal rank
@@ Property / cites work @@
+Semi-passive replication and lazy consensus
@@ Property / cites work: Semi-passive replication and lazy consensus / rank @@
+Normal rank
@@ Property / cites work @@
+The overhead of consensus failure recovery
@@ Property / cites work: The overhead of consensus failure recovery / rank @@
+Normal rank
@@ Property / cites work @@
+Impossibility of distributed consensus with one faulty process
+Normal rank
@@ Property / cites work @@
+Indulgent algorithms (preliminary version)
@@ Property / cites work: Indulgent algorithms (preliminary version) / rank @@
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Distributed Algorithms
@@ Property / cites work: Introduction to Distributed Algorithms / rank @@
+Normal rank