8 ms·

Implementing atomic actions on decentralized data (1983)

• agazso 6y ago
  Link to the PDF http://pages.cs.wisc.edu/~remzi/Classes/739/Spring2003/Papers/p3-reed.pdf http://pages.cs.wisc.edu/~remzi/Classes/739/Spring2003/Paper...
• mav3rick 6y ago
  2PC ?
  • mratsim 6y ago
    2-Phase-Commit protocol i.e. a scheme with "prepare-commit" and eventual rollback.
    • lou1306 6y ago
      It is worth noticing that this paper presents a slightly more advanced protocol than 2PC. Relevant quote (page 21): > The major difference is that, in our scheme, the uncommitted state of the token prevents other atomic actions from reading it. The base 2PC protocol seems to be quite older than 1983. Arguably the first mention of 2PC in the literature is in "Notes on Data Base Operating Systems" by J. Gray (1978), and even that paper is "a compendium of data base management operating systems folklore".
    • mav3rick 6y ago
      Yes I know what it is lol. I was asking if the paper just introduces that.
• mratsim 6y ago
  For proving distributed computing protocol soundness, I'm a big fan of formal verification and model checking, in particular TLA+[1] by Leslie Lamport who is behind the Lamport clocks referenced in the paper and curiously Latex, and the well known Byzantine generals problem in blockchains. In particular a peer-reviewed on synchronization protocol has been proven incorrect on a subtle race condition using formal verification. [1]: https://lamport.azurewebsites.net/tla/tla.html https://lamport.azurewebsites.net/tla/tla.html
• rambojazz 6y ago
  Did they really paywall a paper from 1983?