Cluster Based Resource Allocation Using K-Medoid Clustering Algorithm

International Journal of Computer Science and Engineering
© 2016 by SSRG - IJCSE Journal
Volume 3 Issue 5
Year of Publication : 2016
Authors : D. Arul Selve, K. Kavitha
: 10.14445/23488387/IJCSE-V3I5P102

pdf
Citation:
MLA Style:

D. Arul Selve, K. Kavitha, "Cluster Based Resource Allocation Using K-Medoid Clustering Algorithm" SSRG International Journal of Computer Science and Engineering 3.5 (2016): 10-13.

APA Style:

D. Arul Selve, K. Kavitha,(2016). Cluster Based Resource Allocation Using K-Medoid Clustering Algorithm. SSRG International Journal of Computer Science and Engineering 3.5, 10-13.

Abstract:

Map Reduce was proposed to make simpler the parallel meting out using a distributed computing platform that offers only two interfaces. Map Reduce has come out as a significant model for processing data in huge information centers. Map Reduce is a three phase algorithm consisting of Map, Shuffle and Reduce phases. Due to its extensive deployment, there have been numerous recent papers exactness practical schemes to get better the performance of Map Reduce systems. All these hard work focuses on one of the three phases to obtain performance enhancement. To reduce network traffic within a Map Reduce employment, we deem to aggregate data to send them to distant reduce tasks with same keys. In existing system, a decomposition-based distributed algorithm and online algorithm is used to deal with the large-scale optimization problem and aggregation of data in a dynamic manner respectively. This paper mainly focus in detail on the system process of implementing Partitioning cluster based resource allocation using K- medoid clustering algorithm in decomposition based distribution algorithm. The common realization of k-medoid clustering is the Partitioning Around Medoids (PAM).

References:

[1] Huan Ke, Peng Li, Song Guo, Minyi Guo, ―On Traffic Aware Partition and Aggregation in Map Reduce for Big Data Applications. IEEE Transactions on Parallel and Distributed Systems. Citation Information: DOI 10.1109/ TPDS.2015.2419671
[2] P. Costa, A. Donnelly, A. I. Rowstron, and G. O’Shea, ―Camdoop: Exploiting in-network aggregation for big data applications. In NSDI, vol. 12, 2012, pp. 3–3.
[3] Y. Dinesh Reddy and A. Pio Sajin , ― An Efficient Traffic- Aware Partition and Aggregation for Big Data Applications using Map-Reduce. Indian Journal of Science and Technology, Vol 9(10), DOI: 10.17485/ijst/2016/v9i10/88981, March 2016
[4] T. Condie, N. Conway, P. Alvaro, J. M. Hellerstein, K. Elmeleegy, and R. Sears, ―Map reduce online. in NSDI, vol. 10, no. 4, 2010, p. 20.
[5] J. Lin and C. Dyer, ―Data-intensive text processing with map reduce, Synthesis Lectures on Human Language Technologies, vol. 3, no. 1, pp. 1–177, 2010.

Key Words:

Map Reduce, Big Data, Data partition, Aggregation, K-Medoid Clustering