Abstract

Over the several decades, there is a massive improvement in the computer technology which leads to infinite number of resources in all over the world. Many computing devices have to generate data that comes from various domains. In order to reduce the time complexity and the storage space of data, a novel technique namely map reduce programming model has been proposed to divide the workload among computers in a network to enhance the performance. To rectify the challenging issue of uneven data distribution, and also to enhance the process of load balancing along with memory consumption of computer, data sampling is highly preferred. To enhance the accuracy in scheduling, an innovative method called map reduce task scheduling algorithm is proposed for job deadline constraints. This algorithm classifies the nodes into several levels in heterogeneous clusters. Under this algorithm, a novel data distribution model has been elucidated in which it distributes data according to the node's capacity level respectively.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.