skip to main content
research-article

The Collie: a wait-free compacting collector

Published:15 June 2012Publication History
Skip Abstract Section

Abstract

We describe the Collie collector, a fully concurrent compacting collector that uses transactional memory techniques to achieve wait-free compaction. The collector uses compaction as the primary means of reclaiming unused memory, and performs "individual object transplantations" as transactions. We introduce new terms and requirements useful for analyzing concurrent relocating collectors, including definitions of referrer sets, object transplantation and the notion of individually transplantable objects. The Collie collector builds on these terms and on a detailed analysis of an object's legal states during compaction.

Collie uses a combination of read barriers, write barriers and transactional memory operations. Its read-barrier supports fast, direct object referencing while using a bound, constant time, wait- free triggering path. Collie thereby avoids the constant indirection cost of Brooks [9] style barriers or handle-based heaps [25]. Collie is demonstrated using speculative multi-address atomicity [11], a form of hardware transactional memory supported by the Azul Vega architecture [2].

We evaluate the Collie collector on the Azul platform, on which previous concurrent collectors such as the Pauseless Collector [12] and its generational variant [30] have been commercially available for several years. We discuss Collie's performance while running sustained workloads, and compare it to the Pauseless collector on the same platform. The Collie collector provides significant MMU [5] improvements even in the 1-msec time windows compared to the Pauseless collector. At the same time, it matches Pauseless in throughput and in the ability to scale to large heap sizes.

We believe that the Collie collector is the first garbage collector to leverage hardware-assisted transactional memory. While Collie directly leverages Vega's speculative multi-address atomicity feature (SMA) [11], its design can be easily adapted to other hardware- assisted transactional memory systems. Specifically, the upcoming Intel TSX instruction set extensions [21] include capabilities similar to SMA. We expect Collie to be easily implementable on future commodity servers based on Intel Haswell processors and following processor generations.

References

  1. AMD Corp. Advanced Synchronization Facility. http://developer.amd.com/tools/ASF/Pages/default.aspx, 2009.Google ScholarGoogle Scholar
  2. Azul Systems Inc. Vega 3 Processor. http://www.azulsystems.com/products/vega/processor, 2005.Google ScholarGoogle Scholar
  3. D. F. Bacon, P. Cheng, and V. T. 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, New York, NY, USA, 2003\natexlaba. ACM. ISBN 1--58113-628-5. URL http://doi.acm.org/10.1145/604131.604155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. F. Bacon, P. Cheng, and V. T. 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, New York, NY, USA, 2003. ACM. URL http://doi.acm.org/10.1145/604131.604155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. F. Bacon, P. Cheng, and V. T. 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, New York, NY, USA, 2003. ACM. URL http://doi.acm.org/10.1145/604131.604155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H. G. Baker, Jr. List processing in real time on a serial computer. Commun. ACM, 21: 280--294, April 1978. ISSN 0001-0782. URL http://doi.acm.org/10.1145/359460.359470. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. C. Bill McCloskey, David F. Bacon and D. Grove. Staccato: A parallel and concurrent real-time compacting garbage collector for multiprocessors. In IBM Research Report RC24505, pages 285--298. IBM Research, 2008.Google ScholarGoogle Scholar
  8. S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanović, T. VanDrunen, D. von Dincklage, and B. Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA '06: Proceedings of the 21st annual ACM SIGPLAN conference on Object-Oriented Programing, Systems, Languages, and Applications, pages 169--190, New York, NY, USA, Oct. 2006. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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, LFP '84, pages 256--262, New York, NY, USA, 1984. ACM. ISBN 0-89791-142-3. URL http://doi.acm.org/10.1145/800055.802042. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. Cheng and G. E. Blelloch. A parallel, real-time garbage collector. In Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, PLDI '01, pages 125--136, New York, NY, USA, 2001. ACM. ISBN 1-58113-414-2. 10.1145/378795.378823. URL http://doi.acm.org/10.1145/378795.378823. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Choquette, G. Tene, and K. Normoyle. Speculative multiaddress atomicity, 2006. US Patent 7,376,800.Google ScholarGoogle Scholar
  12. C. Click, G. Tene, and M. Wolf. The Pauseless GC algorithm. In Proceedings of the 1st ACM/USENIX International Conference on Virtual Execution Environments, VEE '05, pages 46--56, New York, NY, USA, 2005. ACM. ISBN 1-59593-047-7. URL http://doi.acm.org/10.1145/1064979.1064988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Damron, A. Fedorova, Y. Lev, V. Luchangco, M. Moir, and D. Nussbaum. Hybrid transactional memory. In Proceedings of the 12th international conference on Architectural support for programming languages and operating systems, ASPLOS-XII, pages 336--346, New York, NY, USA, 2006. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Detlefs and T. Printezis. A Generational Mostly-concurrent Garbage Collector. Technical report, Mountain View, CA, USA, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Detlefs, C. Flood, S. Heller, and T. Printezis. Garbage-first garbage collection. In Proceedings of the 4th International Symposium on Memory Management, ISMM '04, pages 37--48, New York, NY, USA, 2004. ACM. ISBN 1-58113-945-4. URL http://doi.acm.org/10.1145/1029873.1029879. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. H. et al. The ibm blue gene/q compute chip. Micro, EEE, 32 (2): 48--60, march-april 2012. ISSN 0272-1732. 10.1109/MM.2011.108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. T. L. Harris, K. Fraser, and I. A. Pratt. A practical multi-word compare-and-swap operation. In In Proceedings of the 16th International Symposium on Distributed Computing, pages 265--279. Springer-Verlag, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In Proceedings of the 20th annual international symposium on computer architecture, ISCA '93, pages 289--300, New York, NY, USA, 1993. ACM. URL http://doi.acm.org/10.1145/165123.165164. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12: 463--492, July 1990. ISSN 0164-0925. URL http://doi.acm.org/10.1145/78969.78972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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, JGI '01, pages 48--57, New York, NY, USA, 2001. ACM. URL http://doi.acm.org/10.1145/376656.376810. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Intel Inc. Intel Architecture Instruction Set Extensions Programming Reference. http://software.intel.com/file/41604, 2012.Google ScholarGoogle Scholar
  22. JCP. JSR 166: Concurrency Utilities. http://jcp.org/en/jsr/detail?id=166, 2010.Google ScholarGoogle Scholar
  23. H. Kermany and E. Petrank. The Compressor: concurrent, incremental, and parallel compaction. In Proceedings of the 2006 ACM SIGPLAN conference on Programming Language Design and Implementation, PLDI '06, pages 354--363, New York, NY, USA, 2006. ACM. ISBN 1-59593-320-4. URL http://doi.acm.org/10.1145/1133981.1134023. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. P. McGachey, A.-R. Adl-Tabatabai, R. L. Hudson, V. Menon, B. Saha, and T. Shpeisman. Concurrent gc leveraging transactional memory. In Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, PPoPP '08, pages 217--226, New York, NY, USA, 2008. ACM. URL http://doi.acm.org/10.1145/1345206.1345238. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. C. North and J. H. Reppy. Concurrent garbage collection on stock hardware. In Proc. of a conference on Functional programming languages and computer architecture, pages 113--133, London, UK, UK, 1987. Springer-Verlag. ISBN 0-387-18317-5. URL http://dl.acm.org/citation.cfm?id=36583.36591. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. F. Pizlo, E. Petrank, and B. Steensgaard. A study of concurrent real-time garbage collectors. In Proceedings of the 2008 ACM SIGPLAN conference on Programming Language Design and Implementation, PLDI '08, pages 33--44, New York, NY, USA, 2008. ACM. ISBN 978-1-59593-860-2. URL http://doi.acm.org/10.1145/1375581.1375587. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. N. Shavit and D. Touitou. Software transactional memory. In Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, pages 204--213. Aug 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. F. Siebert. Realtime garbage collection in the jamaicavm 3.0. In Proceedings of the 5th international workshop on Java technologies for real-time and embedded systems, JTRES '07, pages 94--103, New York, NY, USA, 2007. ACM. ISBN 978-1-59593-813-8. 10.1145/1288940.1288954. URL http://doi.acm.org/10.1145/1288940.1288954. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. SPEC. Spec: The Standard Performance Evaluation Corporation. http://www.spec.org/, 2010.Google ScholarGoogle Scholar
  30. G. Tene, B. Iyengar, and M. Wolf. C4: the continuously concurrent compacting collector. In Proceedings of the international symposium on Memory management, ISMM '11, pages 79--88, New York, NY, USA, 2011. ACM. URL http://doi.acm.org/10.1145/1993478.1993491. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The Collie: a wait-free compacting collector

      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

      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!