Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 10, Pages: 1-7
Y. Dinesh Reddy1* and A. Pio Sajin2
1Department of Computer Science and Engineering, Sathyabama University, Chennai – 600119, Tamil Nadu, India; [email protected] 2Faculty of computing, Sathyabama University, Chennai – 600119, Tamil Nadu, India; [email protected]
*Author for Correspondence
Y. Dinesh Reddy Department of Computer Science and Engineering, Sathyabama University, Chennai – 600119, Tamil Nadu, India; [email protected]
Objective:The objective of this system to reduce network traffic cost for a Map-Reduce job by designing a novel intermediate data partition scheme. Methods/Analysis: The Map-Reduce model streamlines the large scale information handling on commodities group by abusing parallel map and reduces assignments. Even though numerous endeavors have been made to increase the execution of Map-Reduce works, they disregard the network activity produced in the mix stage, which assumes a basic part in execution upgrade. Findings: Generally, a hash capacity is utilized to segment middle of the road information among decrease assignments, which, nonetheless, is not movement effective in light of the fact that network topology and its data size connected with every key are not thought seriously about. Reexamine to lessen system movement cost for a Map-Reduce work by planning a novel moderate information segment plan. Applications/Improvement: Decomposition based dynamic algorithm and hc algorithm is proposed to manage the huge scale optimization issue for enormous information application is likewise intended to change information parcel and conglomeration in a dynamic way. Finally, broad reproduction results show that the proposed recommendations can altogether decrease network movement cost under offline cases.
Keywords: Big Bata, Data Aggregation, Dynamic Decomposition-based Distributed K- means Algorithm, hc Algorithm, Traffic Minimization
Subscribe now for latest articles and news.