skip to main content
article

Minimizing GC work by analysis of live objects

Authors Info & Claims
Published:01 March 2006Publication History
Skip Abstract Section

Abstract

As complex embedded real-time systems are widely used, automatic memory management, or garbage collection, is a technique that significantly reduces the complex problem of correct memory management. In recent years, people often use time-based real-time GC to meet the deadline of real-time tasks. Some algorithms are proposed to reduce memory requirement based on time-based approaches. However, they mainly focus on scheduling strategy and GC algorithms such as copying algorithm and mark-sweep algorithm et al. This paper treats GC as a dynamical process and gives the analysis of amount of live objects. We propose that GC should process memory space of each task one by one based on the variance of amount of live objects. The proposed approach can minimize GC work and further reduce memory requirement.

References

  1. Kim, Taehyoun; Chang, Naehyuck, Shin; Heonshik. Bounding worst case garbage collection time for embedded real-time systems. Real-Time Technology and Applications - Proceedings, 2000, p 46--55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Robertz, Sven Gestegard; Henriksson, Roger. Time-triggered garbage collection. Proceedings of the ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), 2003, p 93--102. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Detlefs, David. A hard look at hard real-time garbage collection. Proceedings - Seventh IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, Proceedings - Seventh IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2004, p 23--32Google ScholarGoogle Scholar
  4. T. Kim, N. Chang, N. Kim, and H. Shin. Scheduling garbage collector for embedded real-time systems. In Proceedings of the ACM SIGPLAN 1999 Workshop on Languages, Compilers and Tools for Embedded Systems, pages 55--64, May 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund University, July 1998.Google ScholarGoogle Scholar
  6. D. F. Bacon, P. Cheng, and V. T. Rajan. A real-time garbage collector with low overhead and consistent utilization. In Conference Record of the Thirtieth Annual ACM Symposium on Principles of Programming Languages. ACM SIGPLAN Notices, New Orleans, LA, Jan. 2003. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Bollella. The real-time specification for Java. Java series. Addison-Wesley, Reading, MA, USA, 2000.Google ScholarGoogle Scholar
  8. H. G. Baker. List processing in real time on a serial computer. Communications of the ACM, 21(4):280--294, April 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Lieberman, C. Hewitt. A Real-Time Garbage Collector Based on the Lifetimes of Objects. Communications of the ACM, Vol. 26, No. 6, June, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Bengtsson. Real-Time Garbage Collection. Licentiate thesis, Dept. of Computer Science, Lund University, 1990.Google ScholarGoogle Scholar
  11. P. R. Wilson. Uniprocessor Garbage Collection Techniques. In Proceedings of IWMM'92, Springer-Verlag, LNCS 637, St. Malo, France, September 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. T. Withington. How Real is "Real-Time" GC?, OOPS Messenger, October, 1992. OOPSLA'91 Workshop: Garbage Collection in Object Oriented Systems.Google ScholarGoogle Scholar
  13. Dijkstra, Edsger W.; Lamport, Leslie; Martin, A. J.; Scholten, C. S.; Steffens, E. F. M. On-the-fly garbage collection: An exercise in cooperation. Communications the ACM, v 2 n 11, Nov, 1978, p 966--975 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. W. Appel. Simple generational garbage collection and fast allocation. Software Practice and Experience, 19(2):171--183, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Darko Stefanovic. Properties Of Age-Based Automatic Memory Reclamation Algorithms. ACM SIGPLAN Notices, 19(5):157--167, April 1984.Google ScholarGoogle Scholar

Index Terms

  1. Minimizing GC work by analysis of live objects

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!