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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6059799 / rank
 
Normal rank
Property / zbMATH Keywords
 
consensus
Property / zbMATH Keywords: consensus / rank
 
Normal rank
Property / zbMATH Keywords
 
asynchronous system
Property / zbMATH Keywords: asynchronous system / rank
 
Normal rank
Property / zbMATH Keywords
 
fault tolerance
Property / zbMATH Keywords: fault tolerance / rank
 
Normal rank
Property / zbMATH Keywords
 
failure detector
Property / zbMATH Keywords: failure detector / rank
 
Normal rank
Property / zbMATH Keywords
 
distributed algorithm
Property / zbMATH Keywords: distributed algorithm / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60249867 / rank
 
Normal rank
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.1016/j.jpdc.2008.02.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093912643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detector for solving consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable failure detectors for reliable distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-passive replication and lazy consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The overhead of consensus failure recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indulgent algorithms (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Distributed Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Using asynchrony and zero degradation to speed up indulgent consensus protocols
scientific article

    Statements

    Using asynchrony and zero degradation to speed up indulgent consensus protocols (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 July 2012
    0 references
    consensus
    0 references
    asynchronous system
    0 references
    fault tolerance
    0 references
    failure detector
    0 references
    distributed algorithm
    0 references

    Identifiers