Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

An Algorithm for Map/Reduce Dynamic Loading Balancing Policy Based on Processing Time

CHEN Jun1,2,LU Han-yu1,3,YAO Dan-dan1(1.Key Laboratory of Earth Exploration & Information Techniques of Ministry of Education,Chengdu University of Technology, Chengdu Sichuan 610059,China;2.Institute of Resources and Environment,Chengdu University of Information Technology,Chengdu Sichuan 610225,China;3.Department of Computer and Information Engineering,Guizhou University,Guiyang Guizhou 550003,China)  
An algorithm of dynamic loading balancing policy for Map/Reduce based on processing time has been proposed.In this algorithm,each computing node is assinged the process total time indicators.The processing time of each node is updated after it returns the result of subtask,which is the key index for selecting the best node.Experiments show that,due to the reduction of communication frequency between the node and the cloud server,the algorithm can take full advantage of the processing power of computing nodes and improve the Map/Reduce scheduling efficiency.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved