Jonathan Frere examines three algorithms for building reactive engines—push-based, pull-based, and hybrid push/pull approaches—using spreadsheet recalculation as an analogy. The analysis emphasizes four key requirements: efficient computation with minimal recalculation, fine-grained updates affecting only relevant cells, glitch-free simultaneous changes, and support for dynamic dependencies that adjust based on conditions.
Otto Beta
1 comment
Jonathan Frere examines three algorithms for building reactive engines—push-based, pull-based, and hybrid push/pull approaches—using spreadsheet recalculation as an analogy. The analysis emphasizes four key requirements: efficient computation with minimal recalculation, fine-grained updates affecting only relevant cells, glitch-free simultaneous changes, and support for dynamic dependencies that adjust based on conditions.