zbMATH — the first resource for mathematics

Scaling optimistic replication. (English) Zbl 1018.68806
Schiper, André (ed.) et al., Future directions in distributed computing. Research and position papers. Berlin: Springer. Lect. Notes Comput. Sci. 2584, 164-168 (2003).
Summary: Replication improves the performance and availability of sharing information in a large-scale network. Classical, pessimistic replication incurs network access before any access, in order to avoid conflicts and resulting stale reads and lost writes. Pessimistic protocols assume some central locking site or necessitate distributed consensus. The protocols are fragile in the presence of network failures, partitioning, or denial-of-service attacks. They are safe (i.e., stale reads and lost writes do not occur) but at the expense of performance and availability, and they do not scale well.
For the entire collection see [Zbl 1015.68681].

68U99 Computing methodologies and applications
68M14 Distributed systems
Full Text: Link