Partial synchrony based on set timeliness (Q1938365): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marcos Kawazoe Aguilera / rank
Normal rank
 
Property / author
 
Property / author: Marcos Kawazoe Aguilera / 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.1007/s00446-012-0158-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042734235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-efficient leader election and consensus with limited link synchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing omega in systems with weak reliability and synchrony assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial synchrony based on set timeliness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive progress: a gracefully-degrading liveness property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithmically reasoned characterization of wait-free computation (extended abstract) / 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: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure detectors are schedulers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On set consensus numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing unreliable failure detectors with unknown membership / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-set agreement with limited accuracy failure detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure detectors and the wait-free hierarchy (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure detectors encapsulate fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Iterated Restricted Immediate Snapshot Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-\(\Omega \): the weakest failure detector for set agreement / rank
 
Normal rank

Latest revision as of 04:48, 6 July 2024

scientific article
Language Label Description Also known as
English
Partial synchrony based on set timeliness
scientific article

    Statements

    Partial synchrony based on set timeliness (English)
    0 references
    0 references
    0 references
    0 references
    4 February 2013
    0 references
    0 references
    read-write shared memory systems
    0 references
    set timeliness
    0 references
    partial synchrony
    0 references
    consensus
    0 references
    0 references