Question
Conflict-free replicated data types, or CRDTs, define operations on systems that have this replication strategy which can be concurrently applied on the same data by different nodes and be eventually consistent. For 10 points each:
[10h] Name this replication strategy in which different replica nodes of a system are allowed to modify local copies of data independently, with inconsistencies resolved upon communication between nodes.
ANSWER: optimistic replication [or lazy replication]
[10m] Operations on CRDTs typically have this property. This property ensures that a state update that applies a different number of times to different nodes due to network latency will result in the same end state in each node.
ANSWER: idempotency [or idempotent]
[10e] In contrast to distributed databases’ usage of eventual consistency, traditional relational databases tend to rely on transactions with this ACID (“acid”) property, where a transaction must be applied as a single irreducible unit.
ANSWER: atomicity [or atomic]
<Alistair Gray, Other Science - Computer Science>
Summary
| 2023 Chicago Open | 08/05/2023 | Y | 9 | 10.00 | 78% | 22% | 0% |
Data
| BHSU | In Search of Things Past | 0 | 0 | 10 | 10 |
| Evans Hall destruction awaiters | Teach Us to Outgrow Our Ladness | 0 | 10 | 10 | 20 |
| Hang et al., Robert Browning | Curse you, Periplus the Platypus! | 0 | 0 | 0 | 0 |
| remembrance of lost time | I would prefer not to | 0 | 0 | 10 | 10 |
| Quasicrystal Silence | Team Name Think Detail | 0 | 0 | 0 | 0 |
| The anti-STOON-dahl cabal (the tall Keyal et al.) | [moderator voice] yes that is so tenpointscore! is your team feeling bonuspilled? | 0 | 0 | 10 | 10 |
| Don't be Afraid, the Clown's Afraid Too | The Canadians | 0 | 0 | 10 | 10 |
| Romanos IV Diogenes’ Macaroni Grill | The Catastrophic Implosion of Packet Sub | 0 | 0 | 10 | 10 |
| wave2: trimming membership codes 9655377758gp | Saint Peter Andre 3000 | 0 | 10 | 10 | 20 |