Abstract
Many systems rely on distributed caches with thousands of nodes to improve response times and off-load underlying systems. Large-scale caching presents challenges in terms of resource utilization, load balancing, robustness and flexibility of deployment. In this paper, we propose a novel distributed caching method based on dynamic IP address assignment. Keys are mapped to a large IP address space statically and each node is dynamically assigned multiple IP addresses. As a result, we have a system with minimal need for central coordination, while eliminating the single point of failure in competitive solutions. We evaluate our system in our datacenter and show that our approach localizes the effect of load-balancing to only loaded cache servers, while leaving cache clients unaffected and also providing for finely-granular rebalancing.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Nishtala, R., Fugal, H., Grimm, S., Kwiatkowski, M., Lee, H., Li, H.C., McElroy, R., Paleczny, M., Peek, D., Saab, P., et al.: Scaling memcache at facebook. In: Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation, pp. 385–398. USENIX Association (2013)
Facebook Note: Scaling memcached in facebook (2012), https://www.facebook.com/note.php?note_id=39391378919
Adamic, L.A., Huberman, B.A.: Zipfs law and the internet. Glottometrics 3, 143–150 (2002)
Fitzpatrick, B.: Distributed caching with memcached. Linux J. 2004, 5 (2004)
Redis: Redis website (2014), http://redis.io/
Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: Proceedings of the 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies, MSST 2010, pp. 1–10. IEEE Computer Society, Washington, DC (2010)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31, 149–160 (2001)
Karger, D., Sherman, A., Berkheimer, A., Bogstad, B., Dhanidina, R., Iwamoto, K., Kim, B., Matkins, L., Yerushalmi, Y.: Web caching with consistent hashing. Computer Networks 31, 1203–1213 (1999)
Chang, K., Loh, G.H., Thottethodi, M., Eckert, Y., Connor, M.O., Subramanian, L., Mutlu, O.: Enabling efficient dynamic resizing of large dram caches via a hardware consistent hashing mechanism. Technical Report 2013-001, Electrical and Computer Engineering Department,Carnegie Mellon University (2013)
Libmemcached: Libmemcached website (2014), http://libmemcached.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
De Cesaris, D., Katrinis, K., Kotoulas, S., Corradi, A. (2014). Ultra-Fast Load Balancing of Distributed Key-Value Stores through Network-Assisted Lookups. In: Silva, F., Dutra, I., Santos Costa, V. (eds) Euro-Par 2014 Parallel Processing. Euro-Par 2014. Lecture Notes in Computer Science, vol 8632. Springer, Cham. https://doi.org/10.1007/978-3-319-09873-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-09873-9_25
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09872-2
Online ISBN: 978-3-319-09873-9
eBook Packages: Computer ScienceComputer Science (R0)