skip to main content
research-article

Balanced partition scheme for distributed caching systems to solve load imbalance problems

Published: 27 November 2012 Publication History

Abstract

Distributed caching system is usually used to alleviate database load in constructing an enterprise web application system. It helps to speed up dynamic web applications. In order to improve the utilization of caching cluster, an appropriate data partitioning and placement scheme is usually applied. This paper proposes a Balanced Partition Scheme (BPS) to solve load imbalance problems and highly skewed data requests in web application.
In the BPS, which is based on consistent hash algorithm, the partition and placement schemes are designed respectively to guarantee a system's load balance even when the requests of this system are highly skewed. The range of hash function is divided into several groups equally and those groups will be relocated when caching nodes are overloaded. The implementation and evaluation of the BPS is also presented in this paper. The effectiveness of the BPS has been verified in the simulation experiment and the BPS can successfully solve load imbalance problems when faced with a large number of get/set requests.

References

[1]
Giuseppe D., Deniz H., Madan J., G. K., Avinash L., Alex P., S. S., Peter V., and Werner V. Dynamo: Amazon's Highly Available Key-value Store SOSP'07, ACM, October 14-17, 2007.
[2]
D. R. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R.Panigrahy, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web,in Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp.654--663.
[3]
Ion Stoica, Robert Morris, David Liben-Nowell, David R.K, M.Frans Kaashoek, Frank Dabek, and Hari B. Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications IEEE/ACM TRANSACTIONS ON NETWORK, VOL. 11, NO. 1, FEBRUARY 2003.
[4]
P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system based on the XOR metric. In Proceedings of IPTPS02, Cambridge, USA, Mar. 2002.
[5]
Xiong wei, Xie DQ, Jiao BW, and Liu Jie: Self-Adaptive Load Balancing Method in Structured P2P Protocol. Journal of Software, 20(3): 660--670, March. 2009.
[6]
Karthik A R, Lakshminarayanan K, Surana S, and Karp R, Stoica I: Load balancing in structured P2P systems. In: Kaashoek MF, StoicaI, eds. LNCS. Berlin: Springer-Verlag, 2003. 68--79.
[7]
Brad Fitzpatrick. Distributed Caching with Memcached. http://www.linuxjournal.com/article/7451.2004.
[8]
Dormando. http://memcached.org/.2009.
[9]
Ghemawat, S., Gobioff, H., and Leung, S. 2003. The Google file system. In Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles (Bolton Landing, NY, USA, October 19 - 22, 2003). SOSP '03. ACM Press, New York, NY, 29--43.
[10]
Lindsay, B.G. and et. al. Notes on Distributed Databases. Research Report RJ2571(33471), IBM Research, July 1979.
[11]
Microsoft. http://msdn.microsoft.com/en-us/library. 2012.
[12]
Anawat Chankhunthod, Peter Danzig, Chuck Neerdaels, Michael Schwartz and Kurt Worrell. A Hierarchical Internet Object Cache. In SENIX Proceedings, 1996.
[13]
R. Tewari, Michael Dahlin, H. M. Vin and J. S. Kay. Design Considerations for Distributed Caching on the Internet. In Technical Report UTCS TR98-04, Feb 1998.
[14]
Shahriar Vaghar et al, Yang Wang, Jens Skakkebaek. Distributed cache system. In United States Patent Application Publication, US 2006/0177023 A1, Aug, 2006.
[15]
Xingyi Zhang, Xiangxiang Zeng, Linqiang Pan, Smaller Universal Spiking Neural P Systems, Fundamental Informaticae, 87 (2008), 117--136
[16]
Xingyi Zhang, Yun Jiang, Linqiang Pan, Small Universal Spiking Neural P Systems with Exhaustive Use of Rules, Journal of Computational and Theoretical Nanoscience, 7(5)(2010), 1--10
[17]
Linqiang Pan, Xiangxiang Zeng, Small universal spiking neural P systems working in exhaustive mode, IEEE Transactions on Nanobioscience, 10(2)(2011), 99--105.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes
ACM SIGSOFT Software Engineering Notes  Volume 37, Issue 6
November 2012
191 pages
ISSN:0163-5948
DOI:10.1145/2382756
Issue’s Table of Contents
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 November 2012
Published in SIGSOFT Volume 37, Issue 6

Check for updates

Author Tags

  1. C#
  2. distributed caching system
  3. equal-sized partition
  4. load balance

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 134
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media