sinfonia · research

Sinfonia

Sinfonia is a distributed data-sharing service that atomically compares, reads and writes predetermined byte ranges across memory nodes.

Minitransactions declare compare, read and write items before execution. Failed equality checks abort the operation. Reads precede writes: swapping a value returns its old contents, not its replacement. Participants lock accessed ranges for serializability. [1]

Durability is configurable: RAM-REPL can mask failures while a replica survives, but does not protect against loss of every volatile copy. LOG and NVRAM modes synchronously record updates before acknowledging preparation; disk images may lag. Recovery can require downtime. [1]

The application coordinator keeps no log. Recovery consults participant votes instead of waiting for that coordinator to restart, but unavailable logical participants can still block progress. A local redo-log entry alone is insufficient evidence that the whole minitransaction committed. [1]

Relations

related
Compare-and-swap, Serializability, Data durability, Two-phase commit

Limitations

  • Trusted datacenter nodes and crash failures are assumed; Byzantine behavior is outside the design. [1]

Citations

  1. Aguilera et al. Sinfonia: a new paradigm for building scalable distributed systems. SOSP 2007, sections 2-4, Figures 2-5. (accessed 2026-11-16)

Further reading

  1. Marcos K. Aguilera: publication list, Sinfonia conference and journal versions (accessed 2026-11-16)
Sources & caveats
  • Source review of the 2007 conference paper, including protocol and recovery details. The later 2009 journal version is a separate publication. No prototype or crash experiment was reproduced.

JSON: /data/terms/sinfonia.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

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