pineapple · research · also Pineapple replication

Pineapple

Pineapple is a replication protocol that combines Multi-Paxos with atomic shared registers to support linearizable reads, writes and one-shot transactions.

Any node can coordinate single-key reads and writes. The leader orders RMWs and multi-key operations. Pstamps combine an ABD tag with a Multi-Paxos slot; the leader first queries a quorum because an earlier register write may have bypassed it. [1]

Non-blocking execution means execution can follow an ordering decision without a separate dependency wait. It does not eliminate network waits or leader-election delays. Partial synchrony is still needed for leader progress. [1]

Leader changes require ballot-aware stamps and read retry rules from Appendix A.2. A read completes only with a quorum agreeing on its leader and value-pstamp pair; the stable-leader pseudocode alone omits this safeguard. [1]

Relations

related
Gryff, Linearizability, Compare-and-swap

Limitations

  • Independently reading each key does not implement an atomic multi-key scan. One-shot transactions instead go through the leader, whose quorum includes itself. [1]

Citations

  1. Bantikyan et al. Pineapple: Unifying Multi-Paxos and Atomic Shared Registers. NSDI 2025, pp. 759-778; sections 2-3 and Appendix A. (accessed 2026-11-16)
Sources & caveats
  • Protocol interpretation, not an executed cluster benchmark. Research classification does not imply that stock etcd uses this protocol.

JSON: /data/terms/pineapple.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Pineapple. Hesela. 2026-11-16. https://hesela.dev/terms/pineapple/