Dynamic Grouping in an Object-Oriented Virtual Memory Hierarchy

  • Ifor Williams
  • Mario Wolczko
  • Trevor Hopkins
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 276)


Object oriented programming environments frequently suffer serious performance degradation because of a high level of paging activity when implemented using a conventional virtual memory system. Although the fine-grained, persistent nature of objects in such environments is not conducive to efficient paging, the performance degradation can be limited by careful grouping of objects within pages. Such object placement schemes can be classified into four categories — the grouping mechanism may be either static or dynamic and may use information acquired from static or dynamic properties. This paper investigates the effectiveness of a simple dynamic grouping strategy based on dynamic behaviour and compares it with a static grouping scheme based on static properties. These schemes are also compared with near-optimal and random cases.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [EF79]
    Malcom C. Easton and Peter A. Franaszek. Use bit scanning in replacement decisions. IEEE Transactions on Computers, 28(2):133–141, 1979.MATHCrossRefGoogle Scholar
  2. [GR83]
    Adele Goldberg and David Robson. Smalltalk-80: The Language and its Implementation. Addison-Wesley, 1983.Google Scholar
  3. [Jon86]
    Cliff B. Jones. Systematic Software Development Using VDM. Prentice-Hall International, 1986.Google Scholar
  4. [LH83]
    H. Lieberman and C. Hewitt. A real time garbage collector based on the lifetimes of objects. Communications of the ACM, 26(6):419–429, June 1983.CrossRefGoogle Scholar
  5. [Sta84]
    J. W. Stamos. Static grouping of small objects to enhance performance of a paged virtual memory. ACM Transactions on Computer Systems, 2(2):155–180, May 1984.CrossRefGoogle Scholar
  6. [Ste75]
    G. L. Steele. Multiprocessing compactifying garbage collection. Communications of the ACM, 18(9):495–508, September 1975.MATHCrossRefGoogle Scholar
  7. [Ung84]
    David Ungar. Generation scavenging: A non-disruptive, high performance storage reclamation algorithm. In Proc. Software Engineering Symposium on Practical Software Development Environments, pages 157–167, ACM SIGSOFT/SIGPLAN, Pittsburgh PA, May 1984.CrossRefGoogle Scholar
  8. [UP83]
    D. M. Ungar and D. A. Patterson. Berkeley Smalltalk: Who knows where the time goes? In Glenn Krasner, editor, Smalltalk-80: bits of history, words of advice, pages 189–206, Addison-Wesley, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Ifor Williams
    • 1
  • Mario Wolczko
    • 1
  • Trevor Hopkins
    • 1
  1. 1.Department of Computer ScienceThe UniversityManchesterUK

Personalised recommendations