Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Kinetic Algorithms via Self-Adjusting Computation Umut A. Acar1
 

Summary: Kinetic Algorithms via Self-Adjusting Computation
Umut A. Acar1
, Guy E. Blelloch2
, Kanat Tangwongsan2
, and Jorge L. Vittes3
1
Toyota Technological Institute
2
Carnegie Mellon University
3
Stanford University
Abstract. Define a static algorithm as an algorithm that computes some com-
binatorial property of its input consisting of static, i.e., non-moving, objects. In
this paper, we describe a technique for syntactically transforming static algo-
rithms into kinetic algorithms, which compute properties of moving objects. The
technique offers capabilities for composing kinetic algorithms, for integrating dy-
namic and kinetic changes, and for ensuring robustness even with fixed-precision
floating-point arithmetic. To evaluate the effectiveness of the approach, we im-
plement a library for performing the transformation, transform a number of algo-
rithms, and give an experimental evaluation. The results show that the technique

  

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

 

Collections: Computer Technologies and Information Sciences