Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7303))

  • 662 Accesses

Abstract

In a flexible approach to concurrent computation, “processors” ’ (computational resources such as threads) are allocated dynamically, just as objects are; but then, just as objects, they can become unused, leading to performance degradation or worse. We generalized the notion of garbage collection (GC), traditionally applied to objects, so that it also handles collecting unused processors.

The paper describes the processor collection problem, formalizes it as a set of fixpoint equations, introduces the resulting objects-and-processor GC algorithm implemented as part of concurrency support (the SCOOP model) in the latest version of EiffelStudio, and presents benchmarks results showing that the new technique introduces no overhead as compared to traditional objects-only GC, and in fact improves its execution time slightly in some cases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Caromel, D.: Towards A Method of Object-Oriented Concurrent Programming. Communications of the ACM 36(9), 90–102 (1993)

    Article  Google Scholar 

  2. EiffelStudio environment, available for download at eiffel.com

    Google Scholar 

  3. Kafura, D., Washabaugh, D., Nelson, J.: Garbage collection of actors. In: OOPSLA/ECOOP 1990, pp. 126–134 (1990)

    Google Scholar 

  4. Jones, R., Hosking, A., Moss, E.: The Garbage Collection Handbook: The Art of Automatic Memory Management, 2nd edn. Chapman and All/CRC (2011)

    Google Scholar 

  5. Meyer, B.: Systematic Concurrent Object-Oriented Programming. Communications of the ACM 36(9), 56–80 (1993)

    Article  Google Scholar 

  6. Meyer, B.: Object-Oriented Software Construction, 2nd edn. Prentice Hall (1997) (chapter 32 presents SCOOP)

    Google Scholar 

  7. Morandi, B., Nanz, S., Meyer, B.: A Formal Reference for SCOOP. In: Meyer, B., Nordio, M. (eds.) Empirical Software Engineering and Verification. LNCS, vol. 7007, pp. 89–157. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Nienaltowski, P.: Practical framework for contract-based concurrent object-oriented programming, PhD dissertation 17061, Department of Computer Science, ETH Zurich (February 2007), se.ethz.ch/old/people/nienaltowski/papers/thesis.pdf

  9. Nienaltowski, P., Ostroff, J., Meyer, B.: Contracts for Concurrency. Formal Aspects of Computing Journal 21(4), 305–318 (2009)

    Article  MATH  Google Scholar 

  10. Wilson, P.R.: Uniprocessor Garbage Collection Techniques. In: Bekkers, Y., Cohen, J. (eds.) IWMM-GIAE 1992. LNCS, vol. 637, pp. 1–42. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, B., Kogtenkov, A., Akhi, A. (2012). Processors and Their Collection. In: Pankratius, V., Philippsen, M. (eds) Multicore Software Engineering, Performance, and Tools. MSEPT 2012. Lecture Notes in Computer Science, vol 7303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31202-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31202-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31201-4

  • Online ISBN: 978-3-642-31202-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics