ABSTRACT
We have developed an incremental compacting garbage collector for embedded Java systems. The collector divides the heap into equal sized pages and uses the segregated free lists for fast allocation. Collectors that have such a heap layout have a problem of fragmentation in allocating objects larger than the page size. We solve this problem by using the replication-based incremental compaction. The compactor evacuates all objects in one area, the evacuation area, of the heap, thereby creating a large chunk of free space. We developed an algorithm for choosing the evacuation area that effectively cures fragmentation. The compactor does not use any read-barriers. Instead, it uses a technique similar to the replication-based incremental copying collection. This needs forwarding pointers for all evacuated objects. Rather than introducing an extra field for each object, we use a hash table to store forwarding pointers.
Evaluation of this garbage collector implemented in Sun's J2ME Java Virtual Machine showed that all the benchmarks used were able to run without memory starvation using the heap sizes of only 151%-286% of the maximum amount of live data plus 8 KB of the hash table. Experiments on a desktop computer, though it is not a platform for embedded systems, showed that the maximum pause time was shorter than 200 μs, which was comparable to that of our implementation of the snapshot-at-the-beginning collector without compaction. On an ARM processor, the runtime overhead was 1%-16% with 8.0% on average compared to the mark-sweep collector.
- B. Alpern et al. The jalapeño virtual machine. IBM System Journal, 39(1):211--238, 2000. Google Scholar
Digital Library
- D. F. Bacon, P. Cheng, and V. Rajan. A real-time garbage collector with low overhead and consistent utilization. In Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on principles of programming languages (POPL '03), pages 285--298, 2003. Google Scholar
Digital Library
- D. F. Bacon, P. Cheng, and V. Rajan. Controlling fragmentation and space consumption in the metronome, a real-time garbage collector for Java. In Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems (LCTES '03), pages 81--92, 2003. Google Scholar
Digital Library
- D. F. Bacon, P. Cheng, and D. Grove. Garbage collection for embedded systems. In Proceedings of the 4th ACM international conference on embedded software (EMSOFT '04), pages 125--136, 2004. Google Scholar
Digital Library
- O. Ben-Yitzhak, I. Goft, E. K. Kolodner, K. Kuiper, and V. Leikehman. An algorithm for parallel incremental compaction. In Proceedings of the 3rd international symposium on Memory management (ISMM'02), pages 100--105, 2003. Google Scholar
Digital Library
- J. Bentley. Programming Pearls Second Edition. Addison-Wesley, 2000.Google Scholar
- S. M. Blackburn and K. S. McKinley. Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance. In Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementaion (PLDI '08), pages 22--32, 2008. Google Scholar
Digital Library
- G. Bollella, B. Brosgol, J. Gosling, P. Dibble, S. Furr, and M. Turnbull. The Real-Time Specification for Java. Addison Wesley Longman, 2000. Google Scholar
Digital Library
- R. A. Brooks. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In Proceedings of the 1984 ACM Symposium on LISP and functional programming, pages 256--262, 1984. Google Scholar
Digital Library
- Embedded Microprocessor Benchmark Consortium. Java Grinder-Bench version 1.0. http://www.eembc.org.Google Scholar
- R. Gabriel. Performance and Evaluation of Lisp Systems. MIT Press, 1985. Google Scholar
Digital Library
- R. L. Hudson and J. E. B. Moss. Sapphire: Copying GC without stopping the world. In Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande, pages 48--57, 2001. Google Scholar
Digital Library
- T. Kalibera. Replicating real-time garbage collector for Java. In Proceedings of the 7th International Workshop on Java Technologies for Real-time and Embedded Systems (JTRES '09), pages 100--109, 2009. Google Scholar
Digital Library
- B. Lang and F. Dupont. Incremental incrementally compacting garbage collection. In Papers of the Symposium on Interpreters and interpretive techniques, pages 253--263, 1987. Google Scholar
Digital Library
- S. Nettles and J. O'Toole. Real-time replication garbage collection. In Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation (PLDI '93), pages 217--226, 1993. Google Scholar
Digital Library
- F. Pizlo, D. Frampton, E. Petrank, and B. Steensgaard. A real-time garbage collector for multiprocessors. In Proceedings of the 6th international symposium on Memory management (ISMM '07), pages 159--172, 2007. Google Scholar
Digital Library
- N. Sachindran, J. E. B. Moss, and E. D. Berger. MC2: High-performance garbage collection for memory-constrained environments. In Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (OOPSLA '04), pages 81--98, 2004. Google Scholar
Digital Library
- H. Saiki, Y. Konaka, T. Komiya, M. Yasugi, and T. Yuasa. Real-time GC in JeRTy VM using the return-barrier method. In 8th IEEE International Symposium on Object-oriented Real-time distributed Computing (ISORC 2005), pages 140--148, 2005. Google Scholar
Digital Library
- F. Siebert. Hard real-time garbage-collection in the Jamaica virtual machine. In Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications (RTCSA '99), page 96, 1999. Google Scholar
Digital Library
- D. Simon, C. Cifuentes, D. Cleal, J. Daniels, and D. White. Java on the bare metal of wireless sensor devices: the squawk Java virtual machine. In Proceedings of the 2nd international conference on Virtual execution environments, pages 78--88, 2006. Google Scholar
Digital Library
- S. Stanchina and M. Meyer. Mark-sweep or copying? a "best of both worlds" algorithm and a hardware-supported real-time implementation. In Proceedings of the 6th international symposium on memory management (ISMM '07), pages 173--182, 2007. Google Scholar
Digital Library
- Sun mycrosystems, Inc. J2ME CLDC HotSpot implementation virtual macine - white paper. http://java.sun.com/j2me/docs/pdf/CLDC-HI_whitepaper-February_2005.pdf, 2005.Google Scholar
- Sun mycrosystems, Inc. The K virtual machine - white paper. http://java.sun.com/products/kvm/wp, 2000.Google Scholar
- T. Ugawa, M. Yasugi, and T. Yuasa. Replication-based incremental compaction. In Proceedings of the 12th IEEE International Symposium on Object/Component/Service-oriented Real-Time Distributed Computing (ISORC '08), pages 516--524, 2008. Google Scholar
Digital Library
- P. R. Wilson, M. S. Jonstone, M. Neely, and D. Boles. Dynamic storage allocation: A survey and critical review. In Proceedings of the international workshop on memory management (IWMM '95), pages 1--116, 1995. Google Scholar
Digital Library
- T. Yuasa. A Lisp driver to be embedded in Java applications. http://www.yuasa.kuis.kyoto-u.ac.jp/yuasa/jakld.index.html.Google Scholar
- T. Yuasa. Real-time garbage collection on general-purpose machines. Journal of Software and Systems, 11(3):181--198, 1990. Google Scholar
Digital Library
Index Terms
Improved replication-based incremental garbage collection for embedded systems
Recommendations
Improved replication-based incremental garbage collection for embedded systems
ISMM '10We have developed an incremental compacting garbage collector for embedded Java systems. The collector divides the heap into equal sized pages and uses the segregated free lists for fast allocation. Collectors that have such a heap layout have a problem ...
Garbage collection for embedded systems
EMSOFT '04: Proceedings of the 4th ACM international conference on Embedded softwareSecurity concerns on embedded devices like cellular phones make Java an extremely attractive technology for providing third-party and user-downloadable functionality. However, garbage collectors have typically required several times the maximum live ...
Age-based garbage collection
Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...







Comments