Skip to content
2000
Volume 14, Issue 1
  • ISSN: 2666-2558
  • E-ISSN: 2666-2566

Abstract

Background: Extreme growth of data necessitates the need for high-performance computing. MapReduce is among the most sought-after platform for processing large-scale data. Research work and analysis of the existing system has revealed its performance bottlenecks and areas of concern. MapReduce has the problem of skew on its processing nodes. This paper proposes an algorithm for MapReduce to balance the load and eliminate the skew on Map tasks. It reduces the execution time of job by lowering the completion time of the slowest task. Methods: The proposed method performs one-time settlement of load balancing among the Map tasks by analyzing the expected completion time of the Map tasks and redistributes the load. It uses intervals to migrate the overloaded or slows tasks and append them on the under loaded tasks. Results: Experiments revealed an improvement of up to 1.3x by implementing the proposed strategy. Comparison of the proposed technique with other relevant strategies exhibits a better distribution of load among Map tasks and lower level of the skew. Evaluation is done using different workloads. Conclusion: A significant improvement is observed in the performance and reduced completion time of job.

Loading

Article metrics loading...

/content/journals/rascs/10.2174/2213275912666190405141745
2021-01-01
2024-11-08
Loading full text...

Full text loading...

/content/journals/rascs/10.2174/2213275912666190405141745
Loading


  • Article Type:
    Research Article
Keyword(s): hadoop; imbalance; jobs; load; MapReduce; skew; tasks
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test