↓ Skip to main content

Principles of Distributed Systems

Overview of attention for book
Cover of 'Principles of Distributed Systems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Verifying the Consistency of Remote Untrusted Services with Commutative Operations
  3. Altmetric Badge
    Chapter 2 Logical Physical Clocks
  4. Altmetric Badge
    Chapter 3 Be General and Don’t Give Up Consistency in Geo-Replicated Transactional Systems
  5. Altmetric Badge
    Chapter 4 Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs
  6. Altmetric Badge
    Chapter 5 Time Lower Bounds for Distributed Distance Oracles
  7. Altmetric Badge
    Chapter 6 Erasure-Coded Byzantine Storage with Separate Metadata
  8. Altmetric Badge
    Chapter 7 BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration
  9. Altmetric Badge
    Chapter 8 RoBuSt: A Crash-Failure-Resistant Distributed Storage System
  10. Altmetric Badge
    Chapter 9 Checkpointing in Parallel State-Machine Replication
  11. Altmetric Badge
    Chapter 10 Strong Equivalence Relations for Iterated Models
  12. Altmetric Badge
    Chapter 11 The Opinion Number of Set-Agreement
  13. Altmetric Badge
    Chapter 12 On the Importance of Registers for Computability
  14. Altmetric Badge
    Chapter 13 Scalable Wake-up of Multi-channel Single-Hop Radio Networks
  15. Altmetric Badge
    Chapter 14 A Disruption-Resistant MAC Layer for Multichannel Wireless Networks
  16. Altmetric Badge
    Chapter 15 Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots
  18. Altmetric Badge
    Chapter 17 Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
  19. Altmetric Badge
    Chapter 18 Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt
  20. Altmetric Badge
    Chapter 19 Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case
  21. Altmetric Badge
    Chapter 20 A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees
  22. Altmetric Badge
    Chapter 21 Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems
  23. Altmetric Badge
    Chapter 22 Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree
  24. Altmetric Badge
    Chapter 23 Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols
  25. Altmetric Badge
    Chapter 24 LCD: Local Combining on Demand
  26. Altmetric Badge
    Chapter 25 ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
  27. Altmetric Badge
    Chapter 26 Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization
  28. Altmetric Badge
    Chapter 27 Space- and Time-Efficient Long-Lived Test-And-Set Objects
  29. Altmetric Badge
    Chapter 28 WFR-TM: Wait-Free Readers without Sacrificing Speculation of Writers
  30. Altmetric Badge
    Chapter 29 On Developing Optimistic Transactional Lazy Set
  31. Altmetric Badge
    Chapter 30 On the Mailbox Problem
  32. Altmetric Badge
    Chapter 31 Distributed Universality
  33. Altmetric Badge
    Chapter 32 A Practical Distributed Universal Construction with Unknown Participants
Attention for Chapter 1: Verifying the Consistency of Remote Untrusted Services with Commutative Operations
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • High Attention Score compared to outputs of the same age and source (82nd percentile)

Mentioned by

twitter
3 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Verifying the Consistency of Remote Untrusted Services with Commutative Operations
Chapter number 1
Book title
Principles of Distributed Systems
Published in
arXiv, December 2014
DOI 10.1007/978-3-319-14472-6_1
Book ISBNs
978-3-31-914471-9, 978-3-31-914472-6
Authors

Christian Cachin, Olga Ohrimenko, Cachin, Christian, Ohrimenko, Olga

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Professor > Associate Professor 1 50%
Readers by discipline Count As %
Computer Science 2 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 2. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 06 April 2018.
All research outputs
#14,823,017
of 24,002,307 outputs
Outputs from arXiv
#271,819
of 1,011,770 outputs
Outputs of similar age
#190,013
of 361,628 outputs
Outputs of similar age from arXiv
#1,842
of 11,636 outputs
Altmetric has tracked 24,002,307 research outputs across all sources so far. This one is in the 37th percentile – i.e., 37% of other outputs scored the same or lower than it.
So far Altmetric has tracked 1,011,770 research outputs from this source. They receive a mean Attention Score of 4.0. This one has gotten more attention than average, scoring higher than 70% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 361,628 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 46th percentile – i.e., 46% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 11,636 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 82% of its contemporaries.