An Optimal Task Selection Scheme for Hadoop Scheduling
نویسندگان
چکیده
منابع مشابه
Research on Scheduling Scheme for Hadoop Clusters
In this paper, we import a prefetching mechanism into MapReduce model while retaining compatibility with the native Hadoop. Given a dataintensive application running on a Hadoop cluster, our approach estimates the execution time of each task and adaptively preloads an amount of data to the memory before the new task is assigned to the computing node.
متن کاملA Task Scheduling Algorithm for Hadoop Platform
MapReduce is a kind of software framework for easily writing applications which process vast amounts of data on large clusters of commodity hardware. In order to get better allocation of tasks and load balancing, the MapReduce work mode and task scheduling algorithm of Hadoop platform is analyzed in this paper. According to this situation that the number of tasks of the smaller weight job is mo...
متن کاملAn Optimal Task Scheduling for Cluster Systems Using Task Duplication
This paper addresses the problem of scheduling a parallel program represented by a directed acyclic task graph onto homogeneous cluster systems to minimize its execution time. Many sub-optimal algorithms have been proposed that promises acceptable running time but not optimal solutions. We propose an algorithm that guarantees optimal solutions but not acceptable running time. Experiments show t...
متن کاملDelay Scheduling Based Replication Scheme for Hadoop Distributed File System
The data generated and processed by modern computing systems burgeon rapidly. MapReduce is an important programming model for large scale data intensive applications. Hadoop is a popular open source implementation of MapReduce and Google File System (GFS). The scalability and fault-tolerance feature of Hadoop makes it as a standard for BigData processing. Hadoop uses Hadoop Distributed File Sys...
متن کاملAn Optimal Scheme for Multiprocessor Task Scheduling: a Machine Learning Approach
We consider the problem of scheduling periodic task sets on identical multiprocessors. In this case deadlines are equal periods, although results described here can be applied to sporadic task sets with periods not equal to deadlines. We present an online scheduling policy that can be used to design scheduling algorithms. We came up with scheduling rules to minimize the number of preemptions an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IERI Procedia
سال: 2014
ISSN: 2212-6678
DOI: 10.1016/j.ieri.2014.09.093