Protection traps and alternatives for memory management of an object-oriented language

ABSTRACT

Many operating systems allow user programs to specify the protection level (inaccessible, read-only, read-write) of pages in their virtual memory address space, and to handle any protection violations that may occur. Such page-protection techniques have been exploited by several user-level algorithms for applications including generational garbage collection and persistent stores. Unfortunately, modern hardware has made efficient handling of page protection faults more difficult. Moreover, page-sized granularity may not match the natural granularity of a given application. In light of these problems, we reevaluate the usefulness of page-protection primitives in such applications, by comparing the performance of implementations that make use of the primitives with others that do not. Our results show that for certain applications software solutions outperform solutions that rely on page-protection or other related virtual memory primitives.

REFERENCES

• 1: Thomas E. Anderson , Henry M. Levy , Brian N. Bershad , Edward D. Lazowska, The interaction of architecture and operating system design, Proceedings of the fourth international conference on Architectural support for programming languages and operating systems, p.108-120, April 08-11, 1991, Santa Clara, California, United States
• 2: A. W. Appel, Simple generational garbage collection and fast allocation, Software—Practice & Experience, v.19 n.2, p.171-183, February 1989 [doi>10.1002/spe.4380190206]
• 3: Andrew W. Appel , Kai Li, Virtual memory primitives for user programs, Proceedings of the fourth international conference on Architectural support for programming languages and operating systems, p.96-107, April 08-11, 1991, Santa Clara, California, United States
• 4: Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, Santa Clara, California, Apr. 1991. A CM SIGPLAN Not. 26, 4 (Apr. 1991).
• 5: M. P. Atkinson, P. J. Bailey, K. J. Chisholm, P. W. Cockshott, and R. Morrison. An approach to persistent programming. The Computer Journal, 26(4):360-365, Nov. 1983.
• 6: M. P. Atkinson, K. J. Chisholm, W. P. Cockshott, and R. M. Marshall. Algorithms for a persistent heap. Software: Practice and Experience, 13(7):259-271, Mar. 1983.
• 7: R. G. G. Cattell , J. Skeen, Object operations benchmark, ACM Transactions on Database Systems (TODS), v.17 n.1, p.1-31, March 1992 [doi>10.1145/128765.128766]
• 8: Adele Goldberg , David Robson, Smalltalk-80: the language and its implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
• 9: Antony L. Hosking , Eric W. Brown , J. Eliot B. Moss, Update Logging for Persistent Programming Languages: A Comparative Performance Evaluation, Proceedings of the 19th International Conference on Very Large Data Bases, p.429-440, August 24-27, 1993
• 10: Antony L. Hosking , J. Eliot B. Moss, Object fault handling for persistent programming languages: a performance evaluation, Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications, p.288-303, September 26-October 01, 1993, Washington, D.C., United States
• 11: Antony L. Hosking , J. Eliot B. Moss , Darko Stefanovic, A comparative performance evaluation of write barrier implementation, conference proceedings on Object-oriented programming systems, languages, and applications, p.92-109, October 18-22, 1992, Vancouver, British Columbia, Canada
• 12: Ted Kaehler, Virtual memory on a narrow machine for an object-oriented language, Conference proceedings on Object-oriented programming systems, languages and applications, p.87-106, September 29-October 02, 1986, Portland, Oregon, United States
• 13: T. Kaehler and G. Krasner. LOOM--large object-oriented memory for Smalltalk-80 systems. In Krasner { 14}, chapter 14, pages 251-270.
• 14: Glenn Krasner, Smalltalk-80: bits of history, words of advice, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
• 15: Charles Lamb , Gordon Landis , Jack Orenstein , Dan Weinreb, The ObjectStore database system, Communications of the ACM, v.34 n.10, p.50-63, Oct. 1991 [doi>10.1145/125223.125244]
• 16: Henry Lieberman , Carl Hewitt, A real-time garbage collector based on the lifetimes of objects, Communications of the ACM, v.26 n.6, p.419-429, June 1983 [doi>10.1145/358141.358147]
• 17: K. McCall. The Smalltalk-80 benchmarks. In Krasner {14}, chapter 9, pages 153-173.
• 18: J. Eliot B. Moss, Design of the Mneme persistent object store, ACM Transactions on Information Systems (TOIS), v.8 n.2, p.103-139, Apr. 1990 [doi>10.1145/96105.96109]
• 19: J. Eliot B. Moss, Working with Persistent Objects: To Swizzle or Not to Swizzle, IEEE Transactions on Software Engineering, v.18 n.8, p.657-673, August 1992 [doi>10.1109/32.153378]
• 20: Object Design, Inc. ObjectStore User Guide, Oct. 1990. Release 1.0.
• 21: R. A. Shaw. Improving garbage collector performance in virtual memory. Technical Report CSL-TR-87-323, Stanford University, Mar. 1987.
• 22: V. Singhal, S. V. Kakkad, and P. R. Wilson. Texas, an efficient, portable persistent store. In Proceedings of the Fifth International Workshop on Persistent Object Systems, pages 11-33, San Miniato, Italy, Sept. 1992.
• 23: P. G. Sobalvarro. A lifetime-based garbage collector for LISP systems on general-purpose computers, 1988. B.S. Thesis, Dept. of EECS, Massachusetts Institute of Technology, Cambridge.
• 24: David Ungar, Generation Scavenging: A non-disruptive high performance storage reclamation algorithm, Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, p.157-167, April 1984
• 25: David Michael Ungar, The design and evaluation of a high performance Smalltalk system, MIT Press, Cambridge, MA, 1987
• 26: Robert Wahbe, Efficient data breakpoints, ACM SIGPLAN Notices, v.27 n.9, p.200-212, Sept. 1992
• 27: Seth J. White , David J. DeWitt, A Performance Study of Alternative Object Faulting and Pointer Swizzling Strategies, Proceedings of the 18th International Conference on Very Large Data Bases, p.419-431, August 23-27, 1992
• 28: P. R. Wilson and S. V. Kakkad. Pointer swizzling at page fault time: Efficiently and compatibly supporting huge address spaces on standard hardware. In Proceedings of the 1992 International Workshop on Object Orientation in Operating Systems, pages 364-377, Paris, France, Sept. 1992. IEEE Press.
• 29: P. R. Wilson , T. G. Moher, Design of the opportunistic garbage collector, ACM SIGPLAN Notices, v.24 n.10, p.23-35, Oct. 1989

INDEX TERMS

Primary Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.2 Storage Management
          Subjects: Virtual memory

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications
          Subjects: Object-oriented languages
          Nouns: Smalltalk
      D.3.4 Processors
          Subjects: Interpreters; Compilers
  D.4 OPERATING SYSTEMS
      D.4.2 Storage Management
          Subjects: Allocation/deallocation strategies
      D.4.8 Performance
          Subjects: Measurements

General Terms:
Design, Experimentation, Languages, Performance