Kinetic Algorithms Via Self-adjusting Computation [chapter]

Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes
2006 Lecture Notes in Computer Science  
Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we describe a technique for syntactically transforming static algorithms into kinetic algorithms, which compute properties of moving objects. The technique o«ers capabilities for composing kinetic algorithms, for integrating dynamic and kinetic changes, and for ensuring robustness even with fixed-precision floating-point arithmetic. To
more » ... valuate the e«ectiveness of the approach, we implement a library for performing the transformation, transform a number of algorithms, and give an experimental evaluation. The results show that the technique performs well in practice.
doi:10.1007/11841036_57 fatcat:yl67u273mndvllpqukydqtee2a