3 ms·

Typically lock-free algorithms do not retry when a read happens concurrently with a write[1], so they scale very well for read mostly data or when data is parti

Typically lock-free algorithms do not retry when a read happens concurrently with a write[1], so they scale very well for read mostly data or when data is partitioned between writers. Scalability is always going to be poor when writers attempt to modify the same object, no matter the solution you implement. [1] of course you could imagine a lock-free algorithm where reads actually mutate, but that's not common.

menaerus 11mo ago
> Scalability is always going to be poor when writers attempt to modify the same object, no matter the solution you implement. MVCC.
- gpderetta 11mo ago
  Well, yes, that's one way of avoiding mutating the same object of course.
  - menaerus 11mo ago
    Technically it is not because eventually it will be mutated, and that's one way of achieving the scalability in multiple writers scenario.