Summary: An Experimental Analysis of Change Propagation in Dynamic Trees #
Umut A. Acar + Guy E. Blelloch # Jorge L. Vittes §
Abstract
Change propagation is a technique for automatically
adjusting the output of an algorithm to changes in the
input. The idea behind change propagation is to track
the dependences between data and function calls, so
that, when the input changes, functions a#ected by that
change can be re­executed to update the computation
and the output. Change propagation makes it possible
for a compiler to dynamize static algorithms. The
practical e#ectiveness of change propagation, however,
is not known. In particular, the cost of dependence
tracking and change propagation may seem significant.
The contributions of the paper are twofold. First,
we present some experimental evidence that change
propagation performs well when compared to direct im­
plementations of dynamic algorithms. We implement
change propagation on tree­contraction as a solution to
the dynamic trees problem and present an experimental

Source: Acar, Umut - Programming Languages and Systems Group, Max-Planck Institute for Software Systems

Collections: Computer Technologies and Information Sciences