A theorem on atomicity in distributed algorithms | Zendy

Leslie Lamport | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A theorem on atomicity in distributed algorithms

Author(s) -

Leslie Lamport

Publication year - 1990

Publication title -

distributed computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.707

H-Index - 48

eISSN - 1432-0452

pISSN - 0178-2770

DOI - 10.1007/bf01786631

Subject(s) - atomicity , computer science , class (philosophy) , action (physics) , process (computing) , automated theorem proving , theoretical computer science , discrete mathematics , theory of computation , process calculus , distributed computing , algorithm , programming language , mathematics , artificial intelligence , physics , database transaction , quantum mechanics

Reasoning about a distributed algorithm is simplified if we can ignore thetime needed to send and deliver messages and can instead pretend thata process sends a collection of messages as a single atomic action, withthe messages delivered instantaneously as part of the action. A theoremis derived that proves the validity of such reasoning for a large class ofalgorithms. It generalizes and corrects a well-known folk theorem aboutwhen an operation in a multiprocess program can be considered...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research