Measuring the cost of storage management

Higher-Order and Symbolic Computation

Volumn 9, Issue 4, 1996, Pages 323-342

  Tarditi, David ^a   Diwan, Amer ^b  

^a Carnegie Mellon University   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Applicative (functional) programming; Copying garbage collection; Dynamic storage management; Measurement techniques; Standard ML

Indexed keywords

EID: 0005294984     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01806316     Document Type: Article

References (35)

1. Andrew W. Appel. Simple generational garbage collection and fast allocation. Software -Practice and Experience, 19(2):171-184, February 1989.
2. Andrew W. Appel. A Runtime System. Lisp and Symbolic Computation, 3(4):343-380, November 1990.
3. Andrew W. Appel. Compiling with Continuations. Cambridge University Press, 1992.
4. Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.
5. Thomas Ball and James R. Larus. Optimally profiling and tracing programs. In Proceedings of the 19th Annual ACM Symposium on Principles of Programming Languages. ACM, January 1992.
6. David R. Chase. Safety considerations for storage allocation optimizations. Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, 23(7):1-10, July 1988.
7. C.J. Cheney. A nonrecursive list compacting algorithm. Communications of the ACM, 13(11):677-678, November 1970.
8. Ranee Cleaveland, Joachim Parrow, and Bernhard Steffen. The Concurrency Workbench: A semanticsbased tool for the verification of concurrent systems. Transactions on Programming Languages and Systems, 15(l):36-72, January 1993.
9. W. P. Crowley, C. P. Hendrickson, and T. E. Rudy. The SIMPLE code. Technical Report UCID 17715, Lawrence Livermore Laboratory, Livermore, CA, February 1978.
10. Cypress Semiconductor, Ross Technology Subsidiary. SPAR C RISC User 's Guide, second edition, February 1990.
11. ++ programs. Technical Report CU-CS-665-93, University of Colorado, 1993.
12. Digital Equipment Corporation. DS5000/200 KN02 System Module Functional Specification.
13. Amer Diwan, J. Eliot B. Moss, and Richard L. Hudson. Compiler support for garbage collection in a statically typed language. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 273-282, San Francisco, California, June 1992. SIGPLAN, ACM Press.
14. Amer Diwan, David Tarditi, and Eliot Moss. Memory subsystem performance of programs with intensive heap allocation. Technical Report CMU-CS-93-227, School of Computer Science, Carnegie Mellon University, December 1993. Submitted for publication.
15. Amer Diwan, David Tarditi, and Eliot Moss. Memory subsystem performance of programs with copying garbage collection. In Proceedings of the 21st Annual ACM Symposium on Principles of Programming languages, pages 1-14, Portland, Oregon, January 1994. ACM.
16. K. Ekanadham and Arvind. SIMPLE: An exercise in future scientific programming. Technical Report Computation Structures Group Memo 273, MIT, Cambridge, MA, July 1987. Simultaneously published as IBM/T. J. Watson Research Center Research Report 12686, Yorktown Heights, NY.
17. Robert R. Fenichel and Jerome C. Yochelson. A LISP garbage-collector for virtual-memory computer systems. Communications of the ACM, 12(11):611-612, November 1969.
18. Dirk Grunwald, Benjamin Zorn, and Robert Henderson. Improving the cache locality of memory allocation. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 177-186, Albuquerque, New Mexico, June 1993. ACM.
19. M.D. Hill and A.J. Smith. Evaluating associativity in CPU caches. IEEE Transactions on Computers, 38(12):1612-1630, December 1989.
20. James R. Larus. Abstract Execution: A technique for efficiently tracing programs. Software Practice and Experience, 20(12):1241-1258, December 1990.
21. James R. Larus and Thomas Ball. Rewriting executable files to measure program behavior. Technical Report Wis 1083, Computer Sciences Department, University of Wisconsin-Madison, March 1992.
22. H. Lieberman and C. Hewitt. A real-time garbage collector based on the lifetimes of objects. Communications oftheACM,26(6):4l9-429, 1983.
23. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, Cambridge, Massachusetts, 1990.
24. Chih-Jui Peng and Gurindar S. Sohi. Cache memory design considerations to support languages with dynamic heap allocation. Technical Report 860, Computer Sciences Department, University of Wisconsin-Madison, July 1989.
25. Chris Reade. Elements of Functional Programming. Addison-Wesley, Reading, Massachusetts, 1989.
26. Mark B. Reinhold. Cache Performance of Garbage-Collected Programming Languages. PhD thesis, Laboratory for Computer Science, MIT, September 1993.
27. John H. Reppy. Asynchronous Signals IE Standard ML. Technical Report 90-1144, Department of Computer Science, Cornell University, August 1990.
28. Peter Steenkiste. LISP on a Reduced-Instruction-Set Processor: Characterization and Optimization. PhD thesis, Computer Systems Laboratory, Stanford University, Stanford.CA 94305, March 1987.
29. Darko Stefanovic. Generational copying garbage collection for standard ml: a quantitative study, December 1993. MS Project Report.
30. Darko Stefanovic and Eliot Moss. Characterisation of object behavior in Standard ML of New Jersey. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, 1994.
31. David Tarditi and Andrew W. Appel. ML-YACC, version 2.0. Distributed with Standard ML of New Jersey, April 1990.
32. David Ungar. The design and evaluation of a high performance Smalltalk system. ACM Distinguished Dissertation. MIT Press, Cambridge, Massachusetts, 1987.
33. Kevin G. Waugh, Patrick McAndrew, and Greg Michaelson. Parallel implementations from function prototypes: a case study. Technical Report Computer Science 90/4, Heriot-Watt University, Edinburgh, August 1990.
34. Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Caching considerations for generational garbage collection: a case for large and set-associative caches. Technical Report EECS-90-5, University of Illinios at Chicago, December 1990.
35. Benjamin G. Zom. Comparative Performance evaluation of garbage collection algorithms. PhD thesis, University of California, Berkeley, CA 94720, December 1989.