The minimum information about failures for solving non-local tasks in message-passing systems (Q661069): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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-011-0146-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015468161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the distributed 1-solvable tasks / 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: Tight failure detection bounds on atomic object implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detectors to solve certain fundamental problems in distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion in asynchronous systems with failure detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weakest Failure Detector for Message Passing Set-Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum information about failures for solving non-local tasks in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666268 / 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: On the weakest failure detector ever / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detectors to boost obstruction-freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: A knowledge-theoretic analysis of uniform distributed coordination and failure detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every problem has a weakest failure detector / 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: Automatic Classification of Eventual Failure Detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-\(\Omega \): the weakest failure detector for set agreement / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:57, 4 July 2024

scientific article
Language Label Description Also known as
English
The minimum information about failures for solving non-local tasks in message-passing systems
scientific article

    Statements

    The minimum information about failures for solving non-local tasks in message-passing systems (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2012
    0 references
    0 references
    distributed tasks
    0 references
    local tasks
    0 references
    failure detectors
    0 references
    set agreement
    0 references
    fault-tolerance
    0 references
    0 references