Memory management for self-adjusting computation

International Symposium on Memory Management, ISMM

Volumn , Issue , 2008, Pages 51-60

  Hammer, Matthew A ^a   Acar, Umut A ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Computational geometry; Dynamic algorithms; Dynamic dependence graphs; Garbage collection; Memoization; Memory management; Performance; Self adjusting computation

Indexed keywords

DYNAMIC ALGORITHMS; DYNAMIC DEPENDENCE GRAPHS; GARBAGE COLLECTION; MEMOIZATION; MEMORY MANAGEMENT; PERFORMANCE; SELF-ADJUSTING COMPUTATION;

COMPUTATIONAL GEOMETRY; INDUSTRIAL MANAGEMENT; MANAGEMENT; REFUSE COLLECTION; REFUSE DISPOSAL; WASTE DISPOSAL;

DATA STORAGE EQUIPMENT;

EID: 57349097633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375634.1375642     Document Type: Conference Paper

References (40)

1. M. Abadi, B. W. Lampson, and J.-J. Levy. Analysis and caching of dependencies. In Proceedings of die International Conference on Functional Programming (ICFP), pages 83-91, 1996.
2. U. A. Acar. Self-Adjusting Computation. PhD thesis, Department of Computer Science, Carnegie Mellon University, May 2005.
3. U. A. Acar, A. Ahmed, and M. Blume. Imperative self-adjusting computation. In Proceedings of the 35th Annual ACM Symposium on Principles of Programming Languages (POPL), 2008.
4. U. A. Acar, G. E. Blelloch, M. Blume, and K. Tangwongsan. An experimental analysis of self-adjusting computation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2006.
5. U. A. Acar, G. E. Blelloch, and R. Harper. Adaptive functional programming. ACM Transactions on Programming Languages and Systems (TOPLAS), 28(6):990-l 034, 2006.
6. U. A. Acar, G. E. Blelloch, and K. Tangwongsan. Kinetic 3d convex hulls via self-adjusting computation (an illustration). In Proceedings of the 23rd ACM Symposium on Computational Geometry (SCG). 2007.
7. U. A. Acar, G. E. Blelloch, K. Tangwongsan, and J. L. Vittes. Kinetic algorithms via self-adjusting computation. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pages 636-647, September 2006.
8. U. A. Acar, A. Ihler, R. Mettu, and O. Sümer, Adaptive bayesian inference. In Neural Information Systems (NIPS), 2007.
9. H. G. Baker. List processing in real-time on a serial computer. Communications of the ACM, 21(4):280-94, 1978. Also AI Laboratory Working Paper 139, 1977.
10. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. ACM Trans. Math. Softw., 22(4):469-483, m1996.
11. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
12. E. D. Berger, B. G. Zorn, and K. S. McKinley. Reconsidering custom memory allocation. In OOPSLA'02 ACM Conference on Object-Oriented Systems, Languages and Applications. ACM SIGPLAN Notices, Seattle, WA, Nov. 2002. ACM Press.
13. J.Cohen. Garbage collection of linked data structures. Computing Surveys, 13(3):341-367, Sept. 1981.
14. G. E. Collins. A method for overlapping and erasure of lists. Communications of the ACM, 3(12):655-657, Dec. 1960.
15. A. Demers, T. Reps, and T. Teitelbaum. Incremental evaluation of attribute grammars with application to syntax directed editors. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, pages 105-116, 1981.
16. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing (STOC), pages 365-372, 1987.
17. A. Diwan, D, Tarditi, and J. E. B. Moss, Memory subsystem performance of programs with intensive heap allocation. Technical Report CMU-CS-93-227, Computer Science Department, Carnegie-Mellon University, Dec. 1993. Also appears as Fox Memorandum CMU-CS-FOX-93-07.
18. J. Field and T. Teitelbaum. Incremental reduction in the lambda calculus. In Proceedings of the ACM '90 Conference on LISP and Functional Programming, pages 307-322, June 1990.
19. D- Grossman, G. Morrisett, T. Jim, M. Hicks, Y. Wang, and J. Cheney. Region-based memory management in Cyclone. In PLDI [29], pages 282-293.
20. N. Hallenberg, M. Elsman, and M. Tofte. Combining region inference and garbage collection. In PLDI [ 29], pages 141-152.
21. A. Heydon, R. Levin, and Y. Yu. Caching function calls using precise dependencies. In Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 311-320,2000.
22. B. Hudson. Dynamic Mesh Refinement. PhD thesis, Carnegie Mellon University Computer Science Department, Dec. 2007.
23. R. E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
24. Y. A. Liu, S. Stoller, and T. Teitelbaum. Static caching for incremental computation. ACM Transactions on Programming Languages and Systems, 20(3):546-585, 1998.
25. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM. 3:184-195. 1960.
26. J. McCarthy. A Basis for a Mathematical Theory of Computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33-70. North-Holland, Amsterdam, 1963.
27. D. Michie. 'Memo' functions and machine learning. Nature, 218:19- 22, 1968.
28. M. E. O'Neill and F. W. Burton. Smarter garbage collection with simplifiers. In MSPC '06: Proceedings of the 2006 workshop on Memory system performance and correctness, pages 19-30, New York, NY, USA, 2006. ACM.
29. Proceedings of SIGPLAN 2002 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, Berlin, June 2002. ACM Press.
30. W. Pugh. Incremental computation via function caching. PhD thesis, Department of Computer Science, Cornell University, August 1988.
31. W. Pugh and T. Teitelbaum. Incremental computation via function caching. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 315-328, 1989.
32. G. Ramalingam and T. Reps. A categorized bibliography on incremental computation. In Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages (POPL). pages 502-510,1993.
33. A. Shankar and R. Bodik. Ditto: Automatic incrementalization of data structure invariant checks (in Java). In Proceedings of the ACM SIGPLAN 2007 Conference on Programming language Design and Implementation (PLDI), 2007.
34. R. S. Sundaresh and P. Hudak. Incremental compilation via partial evaluation. In Conference Record of the 18th Annual ACM Symposium. on Principles of Programming Languages (POPL), pages 1-13, 1991.
35. M. Tofte, L. Birkedal, M. Elsman, and N. Hallenberg. A retrospective on region-based memory management. Higher-Order and Symbolic Computation, 17(3), Sept. 2004.
36. M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, Feb. 1997.
37. S. Weeks. Whole-program compilation in mlton. In ML '06: Proceedings of the 2006 workshop on ML, pages 1-1, New York, NY, USA, 2006. ACM.
38. P. R. Wilson. Uniprocessor garbage collection techniques. In Y. Bekkers and J. Cohen, editors, Proceedings of International Workshop on Memory Management, volume 637 of Lecture Notes in Computer Science, University of Texas, USA, 16-18 Sept. 1992. Springer-Verlag.
39. D. M. Yellin and R. E. Strom. INC: A language for incremental computations. ACM Transactions on Programming Languages and Systems, 13(2):211-236, Apr. 1991.
40. B. Zom. The measured cost of conservative garbage collection. Software Practice and Experience, 23:733-756, 1993.