Name
Abstract | ||
|---|---|---|
Scheduling tasks in the vicinity of stored data can significantly diminish network traffic. Scheduling optimisation can improve data locality by attempting to locate a task and its related data on the same node. Existing schedulers tend to ignore overhead and tradeoff between data transfer and task placement, and bandwidth consumption, by only emphasising data locality without considering other factors. We present a novel data locality aware scheduler for balancing time consumption and network bandwidth traffic - DLAforBT - to improve data locality for tasks and throughput, with the optimal placement policy exhibiting a threshold-based structure. DLAforBT uses bipartite graph modelling to represent data placement, adopts a judgment mechanism and a precise prediction model to determine moving data or moving computation. It integrates an improved Dominant Resource Fairness (DRF) resource allocation to capture tenants' resource allocation and run as many jobs as possible. DLAforBT improves by 16% of data locality rate, and 25% of throughput. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/CLOUD.2019.00089 | 2019 IEEE 12th International Conference on Cloud Computing (CLOUD) |
Keywords | Field | DocType |
data locality, multi-tenancy, scheduling, bipar tite graph modelling, cloud computing | Locality,Data transmission,Scheduling (computing),Computer science,Multitenancy,Resource allocation,Bandwidth (signal processing),Throughput,Distributed computing,Cloud computing | Conference |
ISSN | ISBN | Citations |
2159-6182 | 978-1-7281-2706-4 | 1 |
PageRank | References | Authors |
0.34 | 4 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jia Ru | 1 | 7 | 2.08 |
| Yun Yang | 2 | 2103 | 150.49 |
| John Grundy | 3 | 146 | 19.78 |
| Jacky Keung | 4 | 97 | 12.44 |
| Li Hao | 5 | 5 | 1.73 |