An experimental analysis of self-adjusting computation

ACM Transactions on Programming Languages and Systems

Volumn 32, Issue 1, 2009, Pages

  Acar, Umut A ^a   Blelloch, Guy E ^b   Blume, Matthias ^a   Harper, Robert ^b   Tangwongsan, Kanat ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Computational geometry; Dynamic algorithms; Dynamic dependence graphs; Memoization; Performance; Self adjusting computation

Indexed keywords

DEPENDENCE GRAPHS; DYNAMIC ALGORITHM; DYNAMIC ALGORITHMS; MEMOIZATION; SELF-ADJUSTING; SELF-ADJUSTING COMPUTATION;

ALGORITHMS; ASYMPTOTIC ANALYSIS; COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; FUNCTIONAL PROGRAMMING;

COMPUTATIONAL EFFICIENCY;

EID: 75649151689     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1596527.1596530     Document Type: Article

References (80)

1. ABADI, M., LAMPSON, B. W., AND ĹEVY, J.-J. 1996. Analysis and caching of dependencies. In Proceedings of the International Conference on Functional Programming. 83-91.
2. ACAR, U. A. 2005. Self-adjusting computation. Ph.D. dissertation, Department of Computer Science, Carnegie Mellon University
3. ACAR, U. A. 2009. Self-adjusting computation (an overview). In Proceedings of ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM, New York.
4. ACAR, U. A., AHMED, A., AND BLUME, M. 2008a. Imperative self-adjusting computation. In Proceedings of the 25th Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
5. ACAR, U. A., BLELLOCH, G. E., TANGWONGSAN, K., AND TÜRKOǦLU, D. 2008b. Robust kinetic convex hulls in 3D. In Proceedings of the 16th Annual European Symposium on Algorithms.
6. ACAR, U. A., BLUME, M., AND DONHAM, J. 2007a. A consistent semantics of self-adjusting computation. In Proceedings of the 16th Annual European Symposium on Programming (ESOP).
7. ACAR, U. A., IHLER, A., METTU, R., AND SÜMER, O. 2007b. Adaptive Bayesian Inference. In Neural Information Processing Systems (NIPS).
8. ACAR, U. A., BLELLOCH, G. E., BLUME, M., HARPER, R., AND TANGWONGSAN, K. 2006a. A library for self-adjusting computation. Electron. Notes Theor. Comput. Sci. 148, 2.
9. ACAR, U. A., BLELLOCH, G. E., BLUME, M., AND TANGWONGSAN, K. 2006b. An experimental analysis of self-adjusting computation. In Proceedings of the ACMSIGPLAN Conference on Programming Language Design and Implementation. ACM, New York.
10. ACAR, U. A., BLELLOCH, G. E., AND HARPER, R. 2006c. Adaptive functional programming. ACM Trans. Program. Lang. Syst. 28, 6, 990-1034.
11. ACAR, U. A., BLELLOCH, G. E., HARPER, R., VITTES, J. L., AND WOO, M. 2004. Dynamizing static algorithms with applications to dynamic trees and history independence. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. ACM, New York.
12. ACAR, U. A., BLELLOCH, G. E., AND HARPER, R. 2003. Selective memoization. In Proceedings of the 30th Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
13. ACAR, U. A., BLELLOCH, G. E., AND HARPER, R. 2002. Adaptive functional programming. In Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages. 247-259.
14. AGARWAL, P. K., GUIBAS, L. J.,EDELSBRUNNER, H., ERICKSON, J., ISARD, M., HAR-PELED, S., HERSHBERGER, J., JENSEN, C., KAVRAKI, L., KOEHL, P., LIN, M., MANOCHA, D., METAXAS, D., MIRTICH, B., MOUNT, D., MUTHUKRISHNAN, S., PAI,D., SACKS, E., SNOEYINK, J., SURI, S., ANDWOLEFSON,O. 2002. Algorithmic issues in modeling motion. ACM Comput. Surv. 34, 4, 550-572.
15. ALEXANDRON, G., KAPLAN, H., AND SHARIR,M. 2005. Kinetic and dynamic data structures for convex hulls and upper envelopes. In Proceedings of the 9thWorkshop on Algorithms and Data Structures (WADS). Lecture Notes in Computer Science, vol.3608, Springer, Berlin, 269-281.
16. ALSTRUP, S., HOLM, J., DE LICHTENBERG, K., AND THORUP,M. 1997. Minimizing diameters of dynamic trees. In Automata, Languages and Programming, 270-280.
17. ALSTRUP, S., HOLM, J., DE LICHTENBERG, K., AND THORUP,M. 2003. Maintaining information in fullydynamic trees with top trees. The Computing Research Repository (CoRR)[cs.DS/0310065].
18. BARBER, C. B., DOBKIN, D. P., AND HUHDANPAA, H. 1996. The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 4, 469-483.
19. BASCH, J., GUIBAS, L. J., AND HERSHBERGER, J. 1999. Data structures for mobile data. J. Algorithms 31, 1, 1-28.
20. BELLMAN, R. 1957. Dynamic Programming. Princeton University Press, Princeton, NJ.
21. BENDER, M. A., COLE, R., DEMAINE, E. D., FARACH-COLTON, M., AND ZITO, J. 2002. Two simplified algorithms for maintaining order in a list. In Proceedings of the 10th European Symposium on Algorithms (ESA 2002). Lecture Notes in Computer Science, vol.2461, 219-223.
22. BENTLEY, J. L. AND SAXE, J. B. 1980. Decomposable searching problems I: Static-to-dynamic transformation. J. Algorithms 1, 4, 301-358.
23. BHATTACHARYA, B. K. AND SEN, S. 1997. On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm. J. Algorithms 25, 1, 177-193.
24. BOISSONNAT, J.-D. AND YVINEC, M. 1998. Algorithmic Geometry. Cambridge Press.
25. BRODAL, G. S. AND JACOB, R. 2002. Dynamic planar convex hull. In Proceedings of the 43 rd Annual IEEE Symposium on Foundations of Computer Science. 617-626.
26. CARLSSON,M. 2002. Monads for incremental computing. In Proceedings of the 7th ACMSIGPLAN International Conference on Functional Programming. ACM, New York, 26-35.
27. CHAN, T.M. 1996. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Computat. Geometry 16, 361-368.
28. CHAN, T.M. 1999. Dynamic planar convex hull operations in near-logarithmic amortized time. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 92-99.
29. CHIANG, Y.-J. AND TAMASSIA, R. 1992. Dynamic algorithms in computational geometry. Proc. IEEE 80, 9, 1412-1434.
30. COHEN, R. F. AND TAMASSIA, R. 1991. Dynamic expression trees and their applications. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 52-61.
31. DEMERS, A., REPS, T., AND TEITELBAUM, T. 1981. Incremental evaluation of attribute grammars with application to syntax-directed editors. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 105-116.
32. DIETZ, P. F. AND SLEATOR,D.D. 1987. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing. ACM, New York, 365-372.
33. DOYLE, J. 1987. A truth maintenance system. In Readings in Nonmonotonic Reasoning, Morgan Kaufmann, Palo Alto, CA, 259-279.
34. EPPSTEIN, D., GALIL, Z., AND ITALIANO, G. F. 1999. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, CRC Press, Ch. 8.
35. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND NISSENZWEIG, A. 1997. Sparsification-A technique for speeding up dynamic graph algorithms. J. ACM 44, 5, 669-696.
36. FIELD, J. 1991. Incremental reduction in the lambda calculus and related reduction systems. Ph.D. dissertation, Department of Computer Science, Cornell University.
37. FIELD, J. AND TEITELBAUM, T. 1990. Incremental reduction in the lambda calculus. In Proceedings of the ACM Conference on LISP and Functional Programming. ACM, New York, 307-322.
38. FREDERICKSON, G. N. 1985. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14, 781-798.
39. FREDERICKSON, G. N. 1997. A data structure for dynamically maintaining rooted trees. J. Algorithms 24, 1, 37-65.
40. GRAHAM, R. L. 1972. An efficient algorithm for determining the convex hull of a finete planar set. Inform. Process. Lett. 1, 132-133.
41. GUIBAS, L. 2004. Modeling motion. In Handbook of Discrete and Computational Geometry, 2nd ed., J. Goodman and J. O'Rourke, Eds. Chapman and Hall/CRC, 1117-1134.
42. GUIBAS, L. AND RUSSEL, D. 2004. An empirical comparison of techniques for updating Delaunay triangulations. In Proceedings of the 20th Annual Symposium on Computational Geometry (SCG'04). ACM Press, New York, 170-179.
43. GUIBAS, L. J. 1998. Kinetic data structures: A state of the art report. In Proceedings of the Third Workshop on the Algorithmic Foundations of Robotics (WAFR'98). 191-209.
44. HAMMER, M. A. AND ACAR, U. A. 2008. Memory management for self-adjusting computation. In Proceedings of the 7th International Symposium on Memory Management (ISMM'08). 51-60.
45. HAMMER, M. A., ACAR, U. A., AND CHEN, Y. 2009. CEAL: A C-based language for self-adjusting computation. In Proceedings of theACMSIGPLAN Conference on Programming Language Design and Implementation. ACM, New York.
46. HENZINGER, M. R. AND KING, V. 1997. Maintaining minimum spanning trees in dynamic graphs. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97). Springer, Berlin, 594-604.
47. HENZINGER, M. R. AND KING, V. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46, 4, 502-516.
48. HEYDON, A., LEVIN, R., AND YU, Y. 2000. Caching function calls using precise dependencies. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. 311-320.
49. HOLM, J., DE LICHTENBERG, K., AND THORUP, M. 2001. Polylogarithmic deterministic fully- dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48, 4, 723-760.
50. HOOVER, R. 1987. Incremental graph evaluation. Ph.D. dissertation, Department of Computer Science, Cornell University.
51. JONES, R. E. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, New York. (With a chapter on distributed garbage collection by R. Lins.)
52. KIRKPATRICK, D. G. AND SEIDEL, R. 1986. The ultimate planar convex hull algorithm. SIAM J. Comput. 15, 1, 287-299.
53. KNUTH, D. E. 1998. The Art of Computer Programming: Sorting and Searching, vol.3, 2nd ed. Addison-Wesley, Ch. 6, 481-489.
54. LEY-WILD, R., ACAR, U. A., AND FLUET, M. 2009. A cost semantics for self-adjusting computation. In Proceedings of the 26th Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
55. LEY-WILD, R., FLUET, M., AND ACAR, U. A. 2008. Compiling self-adjusting programs with continuations. In Proceedings of the International Conference on Functional Programming.
56. LIU, Y. A., STOLLER, S., AND TEITELBAUM, T. 1998. Static caching for incremental computation. ACM Trans. Program. Lang. Syst. 20, 3, 546-585.
57. MCALLESTER, D. 1990. Truth maintenance. In Proceedings of the 8th National Conference on Artificial Intelligence. 1109-1116.
58. MCCARTHY, J. 1963. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems, P. Braffort and D. Hirschberg, Eds. North-Holland, Amsterdam, 33-70.
59. MICHIE, D. 1968. "Memo" functions and machine learning. Nature 218, 19-22.
60. MULMULEY, K. 1994. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ.
61. OVERMARS, M. H. AND VAN LEEUWEN, J. 1981. Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23, 166-204.
62. PUGH,W. AND TEITELBAUM, T. 1989. Incremental computation via function caching. In Proceedings of the 16th Annual ACMSymposium on Principles of Programming Languages. ACM, New York, 315-328.
63. RADZIK, T. 1998. Implementation of dynamic trees with in-subtree operations. ACM J. Exper. Algor. 3, 9.
64. RAMALINGAM, G. AND REPS, T. 1993. A categorized bibliography on incremental computation. In Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 502-510.
65. REPS, T. 1982. Optimal-time incremental semantic analysis for syntax-directed editors. In Proceedings of the 9th Annual Symposium on Principles of Programming Languages, 169-176.
66. RUSSEL,D. 2007. Kinetic data structures in practice. Ph.D. dissertation, Department of Computer Science, Stanford University.
67. RUSSEL, D., KARAVELAS, M. I., AND GUIBAS, L. J. 2007. A package for exact kinetic data structures and sweepline algorithms. Comput. Geom. Theory Appl. 38, 1-2, 111-127.
68. SAXE, J. B. AND BENTLEY, J. L. 1979. Transforming static data structures to dynamic structures (abridged version). In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science. 148-168.
69. SHAMOS, M. I. 1978. Computational geometry. Ph.D. dissertation, Department of Computer Science, Yale University.
70. SHANKAR, A. AND BODIK, R. 2007. DITTO: Automatic incrementalization of data structure invariant checks (in Java). In Proceedings of the ACMSIGPLAN Conference on Programming Language Design and Implementation. ACM, New York.
71. SLEATOR, D. D. AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3, 362-391.
72. SLEATOR, D. D. AND TARJAN, R. E. 1985. Self-adjusting binary search trees. J. ACM 32, 3, 652-686.
73. STALLMAN, R. M. AND SUSSMAN, G. J. 1977. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Art. Intell. 9, 2, 135-196.
74. SUNDARESH, R. S. AND HUDAK, P. 1991. Incremental compilation via partial evaluation. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 1-13.
75. TARJAN, R. AND WERNECK, R. 2005a. Dynamic trees in practice. In Proceeding of the 6th Workshop on Experimental Algorithms (WEA'07). 80-93.
76. TARJAN, R. AND WERNECK, R. 2005b. Self-adjusting top trees. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms.
77. TARJAN, R. E. 1997. Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Mathemat. Program. 78, 167-177.
78. WEGMAN, M. N. AND CARTER, L. 1979. New classes and applications of hash functions. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science. 175-182.
79. WENGER, R. 1997. Randomized quickhull. Algorithmica 17, 3, 322-329.
80. YELLIN, D. M. AND STROM, R. E. 1991. INC: A language for incremental computations. ACMTrans. Program. Lang. Syst. 13, 2, 211-236.