Decreasing the execution time of reducers by revising clustering based on the futuristic greedy approach

Decreasing the execution time of reducers by revising clustering based on the futuristic greedy approach

Blog Article

Abstract Wooden Kit MapReduce is used within the Hadoop framework, which handles two important tasks: mapping and reducing.Data clustering in mappers and reducers can decrease the execution time, as similar data can be assigned to the same reducer with one key.Our proposed method decreases the overall execution time by clustering and lowering the number of reducers.Our proposed algorithm is composed of five phases.In the first phase, data are stored in the Hadoop structure.

In the second phase, we cluster data using the MR-DBSCAN-KD method in order to determine all of the outliers and clusters.Then, the outliers are assigned to the existing clusters using the Soft Doll futuristic greedy method.At the end of the second phase, similar clusters are merged together.In the third phase, clusters are assigned to the reducers.Note that fewer reducers are required for this task by applying approximated load balancing between the reducers.

In the fourth phase, the reducers execute their jobs in each cluster.Eventually, in the final phase, reducers return the output.Decreasing the number of reducers and revising the clustering helped reducers to perform their jobs almost simultaneously.Our research results indicate that the proposed algorithm improves the execution time by about 3.9% less than the fastest algorithm in our experiments.