Skip to main content
SpringerLink
Log in
Book cover

European Conference on Object-Oriented Programming

ECOOP 2006: ECOOP 2006 – Object-Oriented Programming pp 74–98Cite as

The Runtime Structure of Object Ownership

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4067))

Abstract

Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering this is quite challenging. Manual browsing and flat summaries do not scale to complex graphs with 20 million objects. Context is crucial to understanding responsibility and inefficient object connectivity.

We summarize memory footprint with help from the dominator relation. Each dominator tree captures unique ownership. Edges between trees capture responsibility. We introduce a set of ownership structures, and quantify their abundance. We aggregate these structures, and use thresholds to identify important aggregates. We introduce the ownership graph to summarize responsibility, and backbone equivalence to aggregate patterns within trees. Our implementation quickly generates concise summaries. In two minutes, it generates a 14-node ownership graph from 29 million objects. Backbone equivalence identifies a handful of patterns that account for 80% of a tree’s footprint.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldrich, J., Chambers, C.: Ownership Domains: Separating Aliasing Policy from Mechanism. In: Odersky, M. (ed.) ECOOP 2004. LNCS, vol. 3086, pp. 1–25. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Aldrich, J., Kostadinov, V., Chambers, C.: Alias annotations for program understanding. Object-oriented Programming, Systems, Languages, and Applications (2002)

    Google Scholar 

  3. Borland Software Corporation: OptimizeItTM Enterprise Suite (2005), http://www.borland.com/us/products/optimizeit

  4. Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe programming: preventing data races and deadlocks. Object-oriented Programming, Systems, Languages, and Applications (2002)

    Google Scholar 

  5. Boyapati, C., Liskov, B., Shrira, L.: Ownership types for object encapsulation. In: Symposium on Principles of Programming Languages (2003)

    Google Scholar 

  6. Clack, C., Clayman, S., Parrott, D.: Lexical profiling: Theory and practice. Journal of Functional Programming 5(2), 225–277 (1995)

    Article  MATH  Google Scholar 

  7. Clarke, D., Wrigstad, T.: External uniqueness is unique enough. In: Cardelli, L. (ed.) ECOOP 2003. LNCS, vol. 2743, pp. 176–200. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Clarke, D.G., Noble, J., Potter, J.M.: Simple Ownership Types for Object Containment. In: Knudsen, J.L. (ed.) ECOOP 2001. LNCS, vol. 2072, pp. 53–76. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Corbera, F., Asenjo, R., Zapata, E.L.: A framework to capture dynamic data structures in pointer-based codes. IEEE Transactions on Parallel and Distributed Systems 15(2), 151–166 (2004)

    Article  Google Scholar 

  10. De Pauw, W., Sevitsky, G.: Visualizing reference patterns for solving memory leaks in Java. Concurrency: Practice and Experience 12, 1431–1454 (2000)

    Article  MATH  Google Scholar 

  11. Dietl, W., Müller, P.: Universes: Lightweight ownership for JML. Special Issue: ECOOP 2004 Workshop FTfJP, Journal of Object Technology 4(8), 5–32 (2005)

    Google Scholar 

  12. Ghiya, R., Hendren, L.J.: Is it a tree, a DAG, or a cyclic graph? a shape analysis for heap-directed pointers in c. In: Symposium on Principles of Programming Languages (1996)

    Google Scholar 

  13. Hastings, R., Joynce, B.: Purify — fast detection of memory leaks and access errors. In: USENIX Proceedings, pp. 125–136 (1992)

    Google Scholar 

  14. Hill, T., Noble, J., Potter, J.: Scalable visualizations of object-oriented systems with ownership trees. Journal of Visual Languages and Computing 13, 319–339 (2002)

    Article  Google Scholar 

  15. Hirzel, M., Hinkel, J., Diwan, A., Hind, M.: Understanding the connectivity of heap objects. In: International Symposium on Memory Management (2002)

    Google Scholar 

  16. Hitchens, R.: Java NIO, 1st edn. O’Reilly Media, Inc., Sebastopol (2002)

    Google Scholar 

  17. Holzner, S.: Eclipse, 1st edn. O’Reilly Media, Inc., Sebastopol (2004)

    MATH  Google Scholar 

  18. IBM Corporation: Rational PurifyPlus (2005)

    Google Scholar 

  19. Jeannet, B., Loginov, A., Reps, T., Sagiv, M.: A relational approach to interprocedural shape analysis. In: International Static Analysis Symposium. LNCS, Springer, New York (2004)

    Google Scholar 

  20. Lattner, C., Adve, V.: Data structure analysis: A fast and scalable context-sensitive heap analysis. Technical Report UIUCDCS-R-2003-2340, Computer Science Deptartment, University of Illinois (2003)

    Google Scholar 

  21. Lattner, C., Adve, V.: Automatic pool allocation: Improving performance by controlling data structure layout in the heap. In: Programming Language Design and Implementation, Chicago, IL, pp. 129–142 (2005)

    Google Scholar 

  22. Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flow graph. ACM Transactions on Programming Languages and Systems 1(1), 121–141 (1979)

    Article  MATH  Google Scholar 

  23. Mitchell, N., Sevitsky, G.: Leakbot: An automated and lightweight tool for diagnosing memory leaks in large Java applications. In: Cardelli, L. (ed.) ECOOP 2003. LNCS, vol. 2743, pp. 351–377. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Parkinson, M., Bierman, G.: Separation logic and abstraction. In: Symposium on Principles of Programming Languages (2005)

    Google Scholar 

  25. Pheng, S., Verbrugge, C.: Dynamic shape and data structure analysis in java. Technical Report 2005-3, School of Computer Science, McGill University (2005)

    Google Scholar 

  26. Pollet, I., Charlier, B.L., Cortesi, A.: Distinctness and Sharing Domains for Static Analysis of Java Programs. In: Knudsen, J.L. (ed.) ECOOP 2001. LNCS, vol. 2072, pp. 77–98. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Potanin, A.: The Fox — a tool for object graph analysis. Undergraduate Honors Thesis (2002)

    Google Scholar 

  28. Potanin, A., Noble, J., Biddle, R.: Checking ownership and confinement. Concurrency and Computation: Practice and Experience 16(7), 671–687 (2004)

    Article  Google Scholar 

  29. Potanin, A., Noble, J., Biddle, R.: Snapshot query-based debugging. In: Australian Software Engineering Conference, Melbourne, Australia (2004)

    Google Scholar 

  30. Potanin, A., Noble, J., Frean, M., Biddle, R.: Scale-free geometry in object-oriented programs. Communications of the ACM (2005)

    Google Scholar 

  31. Quest Software: JProbe® Memory Debugger (2005), http://www.quest.com/jprobe

  32. Raman, E., August, D.I.: Recursive data structure profiling. In: ACM SIGPLAN Workshop on Memory Systems Performance (2005)

    Google Scholar 

  33. Rayside, D., Mendel, L., Jackson, D.: A dynamic analysis for revealing object ownership and sharing. In: Workshop on Dynamic Analysis (2006)

    Google Scholar 

  34. Rojemo, N., Runciman, C.: Lag, drag, void and use — heap profiling and space-efficient compilation revisited. In: International Conference on Functional Programming, pp. 34–41 (1996)

    Google Scholar 

  35. Runciman, C., Rojemo, N.: New dimensions in heap profiling. Journal of Functional Programming 6(4), 587–620 (1996)

    Article  MATH  Google Scholar 

  36. Sansom, P.M., Peyton Jones, S.L.: Time and space profiling for non-strict higher-order functional languages. In: Symposium on Principles of Programming Languages, San Francisco, CA, pp. 355–366 (1995)

    Google Scholar 

  37. Sansom, P.M., Peyton Jones, S.L.: Formally based profiling for higher-order functional languages. ACM Transactions on Programming Languages and Systems 19(2), 334–385 (1997)

    Article  Google Scholar 

  38. Shaham, R., Kolodner, E.K., Sagiv, M.: Automatic removal of array memory leaks in java. Computational Complexity, 50–66 (2000)

    Google Scholar 

  39. Shaham, R., Kolodner, E.K., Sagiv, M.: Estimating the impact of heap liveness information on space consumption in Java. In: International Symposium on Memory Management (2002)

    Google Scholar 

  40. Shaham, R., Kolodner, E.K., Sagiv, S.: Heap profiling for space-efficient java. In: Programming Language Design and Implementation, pp. 104–113 (2001)

    Google Scholar 

  41. SPEC Corporation: The SPEC JVM Client98 benchmark suite (1998), http://www.spec.org/osg/jvm98

  42. Sun Microsystems: Heap Analysis Tool (2002), https://hat.dev.java.net/

  43. Sun Microsystems: HPROF JVM profiler (2005), http://java.sun.com/developer/technicalArticles/Programming/HPROF.html

Download references

Author information

Authors and Affiliations

  1. IBM TJ Watson Research Center, 19 Skyline Drive, Hawthorne, NY, 10532, USA

    Nick Mitchell

Authors
  1. Nick Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Bedarra Research Lab., 1 Stafford Road, Suite 421, K2H 1B9, Ottawa, Ontario, Canada

    Dave Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitchell, N. (2006). The Runtime Structure of Object Ownership. In: Thomas, D. (eds) ECOOP 2006 – Object-Oriented Programming. ECOOP 2006. Lecture Notes in Computer Science, vol 4067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785477_5

Download citation

  • DOI: https://doi.org/10.1007/11785477_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35726-1

  • Online ISBN: 978-3-540-35727-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation