Fine-grained Analysis on Fast Implementations of Multi-writer Atomic Registers

01/22/2020
by   Kaile Huang, et al.
0

This draft in its current version proves an impossibility result concerning fast implementations of multi-writer distributed atomic registers. This is the first step of our work toward completing the exploration of fast implementations of distributed atomic registers. The plan of our work is outlined in Section 1. The missing sections will be provided soon.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2023

Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and Write

A distributed multi-writer multi-reader (MWMR) atomic register is an imp...
research
04/28/2021

Typability and Type Inference in Atomic Polymorphism

It is well-known that typability, type inhabitation and type inference a...
research
04/27/2023

Proving Logical Atomicity using Lock Invariants

Logical atomicity has been widely accepted as a specification format for...
research
06/11/2020

Randomized Consensus with Regular Registers

The well-known randomized consensus algorithm by Aspnes and Herlihy for ...
research
07/28/2020

A sensitivity analysis for the price of anarchy in non-atomic congestion games

This paper shows that the PoA in non-atomic congestion games is Hölder c...
research
08/28/2019

Strongly Linearizable Implementations of Snapshots and Other Types

Linearizability is the gold standard of correctness conditions for share...
research
07/11/2023

Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers

We present process-algebraic models of multi-writer multi-reader safe, r...

Please sign up or login with your details

Forgot password? Click here to reset