Journal on Communications ›› 2014, Vol. 35 ›› Issue (Z2): 1-8.doi: 10.3969/j.issn.1000-436x.2014.z2.001

• Papers •     Next Articles

Scheduling strategy for achieving locality in cluster

Ping GUO1,2,Li-jiang NING1,Hai-zhu CHEN3   

  1. 1 College of Computer Science,Chongqing University,Chongqing 400044,China
    2 Chongqing Key Laboratory of Software Theory & Technology,Chongqing 400044,China
    3 Department of Software Engineering,Chongqing College of Electronic Engineering,Chongqing 401331,China
  • Online:2014-11-25 Published:2017-06-19
  • Supported by:
    The National Science Foundation for Young Scholars of China;The Natural Science Foundation Project of Chongqing CSTC;The Natural Science Foundation Project of Chongqing CSTC;The Natural Science Foundation Project of Chongqing CSTC

Abstract:

The data locality is divided into two levels.One is called the node data locality,which placing tasks on nodes that contain their input data.The other one is called the rack data locality,which placing tasks on nodes whose rack contains their input data.A new scheduling strategy called DDRF is proposed which combines the DRF and the delay.The DDRF is not only able to meet high locality but also achieve fairness.In the DDRF,the simulation results show the influence on the efficiency of jobs’ implement.

Key words: DDRF, scheduling, locality, computing cluster

No Suggested Reading articles found!