Load Rebalancing using Map reducing Task for Distributed File Systems in Cloud

International Journal of Mobile Computing and Application

© 2015 by SSRG - IJMCA Journal

Volume 2 Issue 1

Year of Publication : 2015

Authors : T.Janani and K.Balamurugan

10.14445/23939141/IJMCA-V2I1P103

How to Cite?

T.Janani and K.Balamurugan, "Load Rebalancing using Map reducing Task for Distributed File Systems in Cloud," SSRG International Journal of Mobile Computing and Application, vol. 2,  no. 1, pp. 1-5, 2015. Crossref, https://doi.org/10.14445/23939141/IJMCA-V2I1P103

Abstract:

Cloud computing is emerging as a new paradigm of large scale distributed computing. Load balancing is one of the main Challenges in Cloud computing which is required to distribute the dynamic workload evenly across all the nodes. In the cloud storage, Load balancing is a key issue. The Map reducing task can be performed parallel over the nodes. The file chunks are not distributed uniformly as possible among the nodes. Emerging distributed systems in production system strongly depends on a central node for chunk reallocation. It would consume a lot of cost to maintain load information. Proper load balancing aids in minimizing resource consumption. This concludes that all the existing techniques mainly focus on reducing overhead, service response time and improving performance etc. various parameters are also identified, and these are used to compare the existing techniques. This paper proposed for centralized server is change in to the decentralized server using Map reducing task.

Keywords:

load balancing algorithm, load balancing challenges, cloud computing, distributed computing

References:

[1] J. Dean and S. Ghemawat, “MapReduce: Simplified Data Processing on Large Clusters,” Proc. Sixth Symp. Operating System Design and Implementation (OSDI ’04), pp. 137-150, Dec. 2004.
[2] A.W. M. Smeulders, M. Worring, S. Santini, A. Gupta, and R. Jain, “Content-based image retrieval at the end of the early years”, IEEE Transaction Pattern Analysis Machine Intelligence, Antony Rowstron and Peter Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems,” in Proc. Middleware, 2001.
[3] John Byers, Jeffrey Considine, and Michael Mitzenmacher,
[4] “Simple Load Balancing for Distributed Hash Tables,” in Proc. IPTPS, Feb. 2003
[5] David Karger and Matthias Ruhl, “New Algorithms for Load
[6] Balancing in Peer-to-Peer Systems,” Tech. Rep. MIT-LCS-TR-911, MIT LCS, July 2003.
[7] J. Westbrook, “Load balancing for response time,” in EuropeanSymposium on Algorithms, 1995, pp. 355–368.
[8] Micah Adler, Eran Halperin, Richard M. Karp,and Vijay V. Vazirani. A Stochastic Process on the Hypercube with Applications to Peer-to-Peer Networks. In Proceedings STOC, pages 575–584, 2003.
[9] Tanveer Ahmed, Yogendra Singh, Analytic study of load balancing techniques using tool cloud analyst.
[10] Zenon Chaczko, Venkatesh Mahadevan, Shahrzad Aslanzadeh  and Christopher Mcdermid, Availabilty and load balancing in     cloud computing, 2011 InternationalConference on Computer and Software Modeling, IPCSIT vol.14 (2011) ACSIT Press, Singapore
[11] Giuseppe Valetto, Paul Snyder, Daniel J. Dubois, Elisabetta  DiNitto and Nicolo M. Calcavecchia, A self-organized load balancing algorithm for overlay based decentralized service networks
[12] Nidhi Jain Kansal, Inderveer Chana, Cloud Load balancing techniques: A step towards green computing, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 1, January 2012.
[13] G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, “Dynamo: Amazon’s Highly Available Key-value Store,” in Proc. 21st ACM Symp. 
[14] Hadoop Distributed File System, “Rebalancing Blocks,” http://developer.yahoo.com/hadoop/tutorial/module2.html#rebalancing. 
[15] HDFSFederation,http://hadoop.apache.org/common/docs/r0.23.0/hadoop-yarn/hadoop-yarn-site/Federation.htm 
[16] D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,” in Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA’04), June 2004, pp. 36–43.