Pages that link to "Item:Q4369859"
From MaRDI portal
The following pages link to Sharing memory robustly in message-passing systems (Q4369859):
Displayed 47 items.
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication (Q392012) (← links)
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems (Q433441) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- A coded shared atomic memory algorithm for message passing architectures (Q518683) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- Light-weight leases for storage-centric coordination (Q853758) (← links)
- Reconfigurable distributed storage for dynamic networks (Q897399) (← links)
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems (Q990136) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- Refined quorum systems (Q992512) (← links)
- Asynchronous bounded lifetime failure detectors (Q1041728) (← links)
- Practically-self-stabilizing virtual synchrony (Q1635506) (← links)
- GeoQuorums: implementing atomic memory in mobile ad hoc networks (Q1953643) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- Asynchronous reconfiguration with Byzantine failures (Q2104034) (← links)
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps (Q2110369) (← links)
- Fragmented objects: boosting concurrency of shared large objects (Q2117716) (← links)
- On atomic registers and randomized consensus in m\&m systems (Q2121060) (← links)
- Time-efficient read/write register in crash-prone asynchronous message-passing systems (Q2218424) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
- Practically stabilizing SWMR atomic memory in message-passing systems (Q2256720) (← links)
- The \(k\)-simultaneous consensus problem (Q2377137) (← links)
- Long-lived RAMBO: trading knowledge for communication (Q2383603) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- Automated test case generation for the paxos single-decree protocol using a coloured Petri net model (Q2423754) (← links)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- Tractable low-delay atomic memory (Q2657276) (← links)
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement (Q2672251) (← links)
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks (Q2700388) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems (Q2868653) (← links)
- (Q3300828) (← links)
- The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)
- The Weakest Failure Detector for Message Passing Set-Agreement (Q3540224) (← links)
- Optimistic Erasure-Coded Distributed Storage (Q3540229) (← links)
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory (Q3540237) (← links)
- (Q5090901) (← links)
- (Q5091100) (← links)
- What Can be Computed in a Distributed System? (Q5170751) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- Self-stabilizing Virtual Synchrony (Q5207915) (← links)
- Wait-freedom with advice (Q5918242) (← links)
- Distributed MST for constant diameter graphs (Q5919895) (← links)
- Wait-free computing (Q6062513) (← links)
- Brief Announcement: The MBroadcast Abstraction (Q6202263) (← links)
- Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds (Q6202279) (← links)