Skip to main content

Reducing the Memory Footprint of Parallel Applications with KSM

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7686))

Abstract

In the era of multicore and manycore programming, memory represents a restrictive resource and it is therefore necessary to share as much as possible between processes. But in many cases, in which a parallel execution of an application has never been foreseen, it is difficult to apply a shared memory model afterwards. The KSM-tool (Kernel Same Page Merging) provides an easy ad-hoc-solution to reduce the overall memory footprint. This paper shows that in the applications of the LHCb experiment at CERN between 8% and 48 % of memory can be gained. In addition it will be discussed how to adjust KSM in order to balance the gain in memory and the additional CPU consumption.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Linux @ cern (2012), http://linux.web.cern.ch/linux/scientific6/

  2. Wlcg worldwide lhc computing grid (2012), http://wlcg.web.cern.ch/

  3. Alef, M.: Cpu benchmarking at gridka (2012), http://indico.cern.ch/getFile.py/access?contribId=40&sessionId=2&resId=0&materialId=slides&confId=160737

  4. Arcangeli, A., Eidus, I., Wright, C.: Increasing memory density by using KSM. In: OLS 2009: Proceedings of the Linux Symposium, pp. 19–28 (July 2009)

    Google Scholar 

  5. Bayer, R.: Symmetric binary b-trees: Data structure and maintenance algorithms. Acta Informatica 1, 290–306 (1972), 10.1007/BF00289509

    Article  MathSciNet  MATH  Google Scholar 

  6. Belyaev, I., Charpentier, P., Easo, S., Mato, P., Palacios, J., Pokorski, W., Ranjard, F., Van Tilburg, J.: Simulation application for the lhcb experiment. Technical Report physics/0306035, CERN, Geneva (June 2003)

    Google Scholar 

  7. Biswas, S., Franklin, D., Savage, A., Dixon, R., Sherwood, T., Chong, F.T.: Multi-execution: multicore caching for data-similar executions. SIGARCH Comput. Archit. News 37(3), 164–173 (2009)

    Article  Google Scholar 

  8. Bugnion, E., Devine, S., Govil, K., Rosenblum, M.: Disco: running commodity operating systems on scalable multiprocessors. ACM Trans. Comput. Syst. 15(4), 412–447 (1997)

    Article  Google Scholar 

  9. Chang, C.-R., Wu, J.-J., Liu, P.: An empirical study on memory sharing of virtual machines for server consolidation. In: 2011 IEEE 9th International Symposium on Parallel and Distributed Processing with Applications (ISPA), pp. 244–249 (May 2011)

    Google Scholar 

  10. Corbet, J.: Transparent hugepages (2009), https://lwn.net/Articles/359158/

  11. Corti, G., Cattaneo, M., Charpentier, P., Frank, M., Koppenburg, P., Mato, P., Ranjard, F., Roiser, S., Belyaev, I., Barrand, G.: Software for the lhcb experiment. IEEE Transactions on Nuclear Science 53(3), 1323–1328 (2006)

    Article  Google Scholar 

  12. Kerrisk, M.: Linux programmer’s manual (2012), http://man7.org/linux/man-pages/man2/madvise.2.html

  13. Yagi, T., Artho, C., Suzaki, K., Iijima, K.: Effects of memory randomization, sanitization and page cache on memory deduplication. In: European Workshop on System Security, EuroSec 2012 (2012)

    Google Scholar 

  14. Schneider, O.: Overview of the lhcb experiment. Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment 446(1-2), 213–221 (2000)

    Article  Google Scholar 

  15. Suzaki, K., Iijima, K., Yagi, T., Artho, C.: Memory deduplication as a threat to the guest os. In: Proceedings of the Fourth European Workshop on System Security, EUROSEC 2011, pp. 1:1–1:6. ACM, New York (2011)

    Chapter  Google Scholar 

  16. Suzaki, K., Yagi, T., Iijima, K., Quynh, N.A., Artho, C., Watanebe, Y.: Moving from logical sharing of guest os to physical sharing of deduplication on virtual machine. In: Proceedings of the 5th USENIX Conference on Hot Topics in Security, HotSec 2010, pp. 1–7. USENIX Association, Berkeley (2010)

    Google Scholar 

  17. Waldspurger, C.A.: Memory resource management in vmware esx server. SIGOPS Oper. Syst. Rev. 36(SI), 181–194 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rauschmayr, N., Streit, A. (2013). Reducing the Memory Footprint of Parallel Applications with KSM. In: Keller, R., Kramer, D., Weiss, JP. (eds) Facing the Multicore-Challenge III. Lecture Notes in Computer Science, vol 7686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35893-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35893-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35892-0

  • Online ISBN: 978-3-642-35893-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics