Historiographer: Strongly-Consistent Distributed Reactive Programming with Minimal Locking
We propose a novel approach to distributed reactive prop- agation that provides strong consistency guarantees with minimal locking. This is achieved by decoupling propagation of the reactive graph from transaction execution, utilizing reactive histories to avoid propagating in-progress results. We formally define soundness properties in terms of histories, and sketch how our semantics upholds them. We implement Histogriographer, a runtime incorporating our methods, and conduct a preliminary evaluation demonstrating perfor- mance improvements of up to 38% on select benchmarks.