Designing a trace format for heap allocation events

Proceedings of the International Symposium on Memory Management

Volumn , Issue , 2000, Pages 35-49

  Chilimbi, Trishul ^a   Jones, Richard ^b   Zorn, Benjamin ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; ENCODING (SYMBOLS); PROBLEM SOLVING; SERVERS;

DYNAMIC STORAGE ALLOCATION;

STORAGE ALLOCATION (COMPUTER);

EID: 0034592578     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/362422.362435     Document Type: Conference Paper

References (23)

1. Emery D. Berger and Robert D. Blumofe. Hoard: A fast, scalable, and memory-efficient allocator for shared-memory multiprocessors. Technical Report CS-TR-99-22, University of Texas, Austin, September 1, 1999.
2. David Detlefs, Al Dosser, and Benjamin Zorn. Memory allocation costs in large C and C++ programs. SofTware-Practice and Experience, 24(6):527-542, June 1994.
3. Jens Ernst, William Evans, Christopher W. Fraser, Steven Lucco, and Todd A. Proebsting. Code compression. ACM SIGPLAN Notices, 32(5):358-365, May 1997.
4. Christopher W. Fraser. Automatic inference of models for statistical code compression. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 242-246, 1999.
5. Thorna O. Humphries, Artur W. Klauser, Alexander L. Wolf, and Benjamin G. Zorn. POSSE trace format version 1.0. Technical Report CU-CS-897-00, Department of Computer Science, University of Colorado, Boulder, CO, January 2000.
6. International Standards Organization. ISO 8879: Standard Generalized Markup Language, 1986.
7. International Standards Organization. ISO 8824-4: Abstract Syntax Notation One (ASN.1), 1998.
8. International Standards Organization. ISO 8825-2: ASN.1 Encoding Rules: Specification of Packed Encoding Rules (PER), 1998.
9. Eric E. Johnson. PDATS II: Improved compression of address traces. In 1999 IEEE International Performance, Computing, and Communications Conference, February 1999.
10. Eric E. Johnson and Jiheng Ha. PDATS: Lossless address trace compression for reducing file size and access time. In Proceedings of the 1994 IEEE International Phoenix Conference on Computers and Communication, April 1994.
11. Mark S. Johnstone. Non-Compacting Memory Allocation and Real-Time Garbage Collection. PhD thesis, The University of Texas at Austin, Austin, Texas, 1997.
12. Mark S. Johnstone and Paul R. Wilson. The memory fragmentation problem: Solved? In Proceedings of the International Symposium on Memory Management (ISMM-98), volume 34, 3 of ACM SIGPLAN Notices, pages 26-36, New York, October 17-19 1999. ACM Press.
13. John Larmouth. Understanding OSI. International Thompson Computer Press, 1996.
14. Per-Åke Larson and Murali Krishnan. Memory allocation for long-running server applications. In Proceedings of the International Symposium on Memory Management (ISMM-98), volume 34, 3 of ACM SIGPLAN Notices, pages 176-185, New York, October 17-19 1999. ACM Press.
15. John R. Levine. Linkers and Loaders. Morgan Kaufman, 2000.
16. Kurt Nørmack. Programming World Wide Web pages in Scheme. ACM SIGPLAN Notices, 34(12):37-46, December 1999.
17. William Pugh. Compressing Java class files. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 247-258, 1999.
18. Alan Dain Samples. Mache: No-loss trace compaction. Technical Report CSD-88-446, University of California, Berkeley, September 15, 1988.
19. S.J.G. Scheuerl, R.C.H. Conner, R. Morrison, J.E.B. Moss, and D.S. Munro. The MaStA I/O trace format. Technical Report CS/95/4, School of Mathematical and Computational Sciences, University of St. Andrews, North Haugh, St Andrews, Fife, Scotland, 1995.
20. Matthew L. Seidl and Benjamin G. Zorn. Segregating heap objects by reference behaviour and lifetime. In Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), pages 12-23, 1998.
21. K. Phong Vo. Vmalloc: A general and efficient memory allocator. Software Practice & Experience, 1996.
22. Jacob Ziv and Abraham Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(3):337-343, May 1977.
23. Benjamin Zorn and Dirk Grunwald. Empirical measurements of six allocation-intensive C programs. SIGPLAN Notices, 27(12):71-80, December 1992.