skip to main content
10.1145/2480362.2480453acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

A multi-resource load balancing algorithm for cloud cache systems

Published:18 March 2013Publication History

ABSTRACT

With the advent of cloud computing model, distributed caches have become the cornerstone for building scalable applications. Popular systems like Facebook [1] or Twitter use Memcached [5], a highly scalable distributed object cache, to speed up applications by avoiding database accesses. Distributed object caches assign objects to cache instances based on a hashing function, and objects are not moved from a cache instance to another unless more instances are added to the cache and objects are redistributed. This may lead to situations where some cache instances are overloaded when some of the objects they store are frequently accessed, while other cache instances are less frequently used.

In this paper we propose a multi-resource load balancing algorithm for distributed cache systems. The algorithm aims at balancing both CPU and Memory resources among cache instances by redistributing stored data. Considering the possible conflict of balancing multiple resources at the same time, we give CPU and Memory resources weighted priorities based on the runtime load distributions. A scarcer resource is given a higher weight than a less scarce resource when load balancing. The system imbalance degree is evaluated based on monitoring information, and the utility load of a node, a unit for resource consumption. Besides, since continuous rebalance of the system may affect the QoS of applications utilizing the cache system, our data selection policy ensures that each data migration minimizes the system imbalance degree and hence, the total reconfiguration cost can be minimized. An extensive simulation is conducted to compare our policy with other policies. Our policy shows a significant improvement in time efficiency and decrease in reconfiguration cost.

References

  1. Lucas Nealan. Caching & Performance: Lessons from Facebook. Retrieved May 10,2012, from http://www.scribd.com/doc/4069180/Caching-Performance-Lessonsfrom-FacebookGoogle ScholarGoogle Scholar
  2. Roebuck, K. Platform as a Service(PaaS):High-Impact Emerging Technology - What You Need to Know: Definitions, Adoptions, Impact, Benefits, Maturity, Vendors. Tebbo Publishers, 2011.Google ScholarGoogle Scholar
  3. Gualtieri, M. Rymer, J. R. The Forrester Wave#8482;: Elastic Caching Platforms, Q2 2010. Retrieved May 14, 2012,from Forrester Companies: http://www.forrester.com/The+Forrester+Wave+Elastic+Caching+Platforms+Q2+2010/fulltext/-/E-RES55505?docid=55505Google ScholarGoogle Scholar
  4. Perez-Sorrosal, F., Patiño-Martínez, M. Jiménez-Peris, R. and Kemme, B. Elastic SI-Cache: consistent and scalable caching in multi-tier architectures. The VLDB Journal --- The International Journal on Very Large Data Bases, 20 (6).841--865 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Memcached. Retrieved March 15, 2012, from Dormando Companies: http://memcached.org/Google ScholarGoogle Scholar
  6. Scudder, J. Effective Memcache. Retrieved June, 2012, from https://developers.google.com/appengine/articles/scaling/memcacheGoogle ScholarGoogle Scholar
  7. You, G. W., Hwang, S. W. and Jain, N. Scalable Load Balancing in Cluster Storage Systems. In Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware, (Lisboa, Portugal, 2011), Springer Publishers, 101--122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Sung Goo Yoo, Kil To Chong. Hot Spot Prediction Algorithm for Shared Web Caching System using NN. In 2007 International Symposium on Information Technology Convergence, (Jeonju, Korea, 2007), Springer Publishers, 125--129. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Chandra Chekuri. On multidimensional packing problems. SIAM Journal on Computing.33 (4).837--851. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Csirik, J., Frenk, J. B. G., Labbé, M and Zhang, Shu. On the multidimensional vector bin packing. Acta Cybern Publishers, 1990.Google ScholarGoogle Scholar
  11. Chekuri C., Khanna S. On multi-dimensional packing problems. In Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. (Baltimore, Maryland, 1999), Society for Industrial and Applied Mathematics Philadelphia Publishers, 185--194 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Patt-Shamir, B., Rawitz, D. Vector bin packing with multiple-choice. In Proceedings of the 12th Scandinavian conference on Algorithm Theory. (Bergen, Norway, 2010), Springer Publishers, 248--259. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I. Load balancing in dynamic structured peer-to-peer systems. Performance Evaluation - P2P computing systems, 63(3). 217--240. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Kunkle D., Schindler J. A load balancing framework for clustered storage systems. In Proceedings of the 15th International Conference on High Performance Computing, (Bangalore, India, 2008). Springer Publishers, 57--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Gulisano, V., Jiménez-Peris, R., Patiño-Martínez, M., Soriente, C., Valduriez, P. StreamCloud: An Elastic and Scalable Data Streaming System. In Proceedings of the 2012 Parallel and Distributed Systems. Page(s): 1 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Milan-Franco, J. M., Jiménez-Peris, R., Patiño-Martínez, M. and Kemme, B. Adaptive Middleware for Data Replication. In Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware, (Toronto, Canada, 2004). ACM Publishers, 175--194. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Leinberger, W., Karypis, G., Kumar, V. Job scheduling in the presence of multiple resource requirements. In Proceedings of the 1999 ACM/IEEE conference on Supercomputing, (Portland, Oregon, USA, 1999) ACM Publishers. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Chih-Chiang, Y., Kun-Ting, C., Jing-Ying, C. Market-Based Load Balancing for Distributed Heterogeneous Multi-Resource Servers. In Proceedings of the 2009 15th International Conference on Parallel and Distributed Systems (Shenzhen, China, 2009) IEEE Computer Society Publishers, 158--165. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Jiménez-Peris, R., Patiño-Martínez, M., Magoutis, K. Bilas, A. and Brondino, I. CumuloNimbo: A highly-scalable transaction processing platform as a service. ERCIM NEWS n° 89, Special theme Big Data, 34--35. April 2012.Google ScholarGoogle Scholar
  20. Friedman, J. H., Baskett, F. and Shustek, L. J. An algorithm for finding nearest neighbors. IEEE Transactions on Computers, C-24(10). 1000--1006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A multi-resource load balancing algorithm for cloud cache systems

              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
              • Published in

                cover image ACM Conferences
                SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
                March 2013
                2124 pages
                ISBN:9781450316569
                DOI:10.1145/2480362

                Copyright © 2013 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 18 March 2013

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article

                Acceptance Rates

                SAC '13 Paper Acceptance Rate255of1,063submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader