Improving map reduce task scheduling and micro-partitioning mechanism for mobile cloud multimedia services
S. Saravanan, V. Venkatachalam · International Journal of Advanced Intelligence Paradigms · 2016
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.