Skip to main content

R-Memcached: A Reliable In-Memory Cache System for Big Key-Value Stores

  • Conference paper
  • First Online:
Big Data Computing and Communications (BigCom 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9196))

Included in the following conference series:

Abstract

Large-scale key-value stores are widely used in many Web-based systems to store huge amount of data as (key, value) pairs. In order to reduce the latency of accessing such (key, value) pairs, an in-memory cache system is usually deployed between the front-end Web system and the back-end database system. In practice, a cache system may consist of a number of server nodes, and fault-tolerance is a critical feature to maintain the latency Service-Level Agreements (SLAs). In this paper, we present the design, implementation, and evaluation of R-Memcached, a reliable in-memory key-value cache system that is built on top of the popular Memcached. R-Memcached exploits coding techniques to achieve reliability, and can tolerate up to two node failures. Our experimental results show that R-Memcached can maintain very good latency and throughput performance even during the period of node failures.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Fitzpatrick, B.: Distributed caching with memcached. Linux Journal 2004(124) (2004)

    Google Scholar 

  2. Nishtala, R., Fugal, H., Grimm, S., Kwiatkowski, M., Lee, H., Li, H.C., McElroy, R., et al.: Scaling memcache at facebook. In: NSDI, pp. 385–398 (2013)

    Google Scholar 

  3. Morgan, T.P.: Facebook opens up tools to scale memcached. http://www.enterprisetech.com/2014/09/15/facebook-opens-tools-scale-memcached/

  4. Andrew, T., Maarten, V.S.: Distributed systems. Pearson Prentice Hall (2007)

    Google Scholar 

  5. Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A.: Raid: High-performance, reliable secondary storage. CSUR 26, 145–185 (1994)

    Article  Google Scholar 

  6. Karger, D., Sherman, A., Berkheimer, A., Bogstad, B., et al.: Web caching with consistent hashing. Computer Networks 31(11), 1203–1213 (1999)

    Article  Google Scholar 

  7. Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., et al.: A view of cloud computing. Communications of the ACM 53(4), 50–58 (2010)

    Article  Google Scholar 

  8. Thusoo, A., Sarma, J.S., Jain, N., Shao, Z., Chakka, P., Zhang, N., et al.: Hive-a petabyte scale data warehouse using hadoop. In: ICDE (2010)

    Google Scholar 

  9. Abadi, D.J.: Tradeoffs between parallel database systems, hadoop, and hadoopdb as platforms for petabyte-scale analysis. In: Gertz, M., Ludäscher, B. (eds.) SSDBM 2010. LNCS, vol. 6187, pp. 1–3. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Cheng, H., Huseyin, S., Yikang, X., Aaron, O., Brad, C., Parikshit, G., Jin, L., Sergey, Y.: Erasure coding in windows azure storage. In: USENIX ATC (2012)

    Google Scholar 

  11. Berezecki, M., Frachtenberg, E., Paleczny, M., Steele, K.: Power and performance evaluation of memcached on the tilepro64 architecture. Sustainable Computing: Informatics and Systems (2012)

    Google Scholar 

  12. Meaney, P.J., Lastras-Montao, L.A., Papazova, V.K., Stephens, E., Johnson, J.S., Alves, L.C., et al.: Ibm zenterprise redundant array of independent memory subsystem. IBM Journal of Research and Development (2012)

    Google Scholar 

  13. Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., Paleczny, M.: Workload analysis of a large-scale key-value store. In: ACM SIGMETRICS, pp. 53–64 (2012)

    Google Scholar 

  14. Plank, J.S., Greenan, K.M.: Jerasure: A library in c facilitating erasure coding for storage applications-version 2.0. Technical Report UT-EECS-14-721 (2014)

    Google Scholar 

  15. Chu, X., Liu, C., Ouyang, K., Yung, L.S., Liu, H., Leung, Y.-W.: Perasure: a parallel cauchy reed-solomon coding library for gpus. In: IEEE ICC (2015)

    Google Scholar 

  16. Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazires, D., et al.: The case for ramclouds: scalable high-performance storage entirely in dram. In: ACM SIGOPS, pp. 92–105 (2010)

    Google Scholar 

  17. Lim, H., Fan, B., Andersen, D. G., Kaminsky, M.: Silt: A memory-efficient, high-performance key-value store. In: SOSP, pp. 1–13 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Chengjian Liu or Xiaowen Chu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, C., Ouyang, K., Chu, X., Liu, H., Leung, YW. (2015). R-Memcached: A Reliable In-Memory Cache System for Big Key-Value Stores. In: Wang, Y., Xiong, H., Argamon, S., Li, X., Li, J. (eds) Big Data Computing and Communications. BigCom 2015. Lecture Notes in Computer Science(), vol 9196. Springer, Cham. https://doi.org/10.1007/978-3-319-22047-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22047-5_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22046-8

  • Online ISBN: 978-3-319-22047-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics