FlowS:A Fair Scheduling Method for Mapreduce Dataflow
XU Shu-ren
Abstract
XU Shu-ren
Abstract
MapReduce Job scheduling has been paid great attention in academic research.Based on the analysis of MapReduce dataflow scheduling model,this paper presented a fair scheduling method for MapReduce dataflow-FlowS.This method can not only provide the isolation of MapReduce dataflow through dataflow pools,but also assure the fairness of resource allocation through dynamic construction algorithm.The results of experiences show that the proposed method can improve the processing efficiency of Hadoop Clusters.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
MapReduce Job scheduling has been paid great attention in academic research.Based on the analysis of MapReduce dataflow scheduling model,this paper presented a fair scheduling method for MapReduce dataflow-FlowS.This method can not only provide the isolation of MapReduce dataflow through dataflow pools,but also assure the fairness of resource allocation through dynamic construction algorithm.The results of experiences show that the proposed method can improve the processing efficiency of Hadoop Clusters.
Key concepts: Dataflow, Computer science, Dataflow architecture, Scheduling (production processes), Parallel computing, Distributed computing, Mathematical optimization, Mathematics