Scheduling strategy for achieving locality in cluster
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 propo...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.z2.001/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539697184079872 |
|---|---|
| author | Ping GUO Li-jiang NING Hai-zhu CHEN |
| author_facet | Ping GUO Li-jiang NING Hai-zhu CHEN |
| author_sort | Ping GUO |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-edb64b38d588474ba40d317987cfaba2 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2014-11-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-edb64b38d588474ba40d317987cfaba22025-01-14T06:45:01ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-11-01351859688758Scheduling strategy for achieving locality in clusterPing GUOLi-jiang NINGHai-zhu CHENThe 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.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.z2.001/DDRFschedulinglocalitycomputing cluster |
| spellingShingle | Ping GUO Li-jiang NING Hai-zhu CHEN Scheduling strategy for achieving locality in cluster Tongxin xuebao DDRF scheduling locality computing cluster |
| title | Scheduling strategy for achieving locality in cluster |
| title_full | Scheduling strategy for achieving locality in cluster |
| title_fullStr | Scheduling strategy for achieving locality in cluster |
| title_full_unstemmed | Scheduling strategy for achieving locality in cluster |
| title_short | Scheduling strategy for achieving locality in cluster |
| title_sort | scheduling strategy for achieving locality in cluster |
| topic | DDRF scheduling locality computing cluster |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.z2.001/ |
| work_keys_str_mv | AT pingguo schedulingstrategyforachievinglocalityincluster AT lijiangning schedulingstrategyforachievinglocalityincluster AT haizhuchen schedulingstrategyforachievinglocalityincluster |