Name
Abstract | ||
|---|---|---|
Large-scale data centres are the growing trend for modern computing systems. Since a large-scale data centre has to manage a large number of machines and jobs, deploying multiple independent schedulers (termed as distributed schedulers in literature) to make scheduling decisions simultaneously has been shown as an effective way to speed up the processing of large quantity of submitted jobs and data. The key drawback of distributed schedulers is that since these schedulers schedule different jobs independently, the scheduling decisions made by different schedulers may conflict with each other due to the possibility that different scheduling decisions refer to the same subset of the resources in the data centre. Conflicting scheduling decisions cause additional scheduling attempts and consequently increase the scheduling cost. More resources each scheduler demands, higher scheduling cost may incur and longer job response times the users may experience. It is useful to investigate the balanced points in terms of resource demands for each of independent schedulers, so that the distributed schedulers can all achieve decent job performance without experiencing undesired resource competition. To address this issue, we model distributed scheduling and resource conflict using the game theory and conduct the quantitative analysis about scheduling cost and job performance. Further, based on the analysis, we develop the conflict-aware scheduling strategies to reduce the scheduling cost and improve job performance. We have conducted the simulation experiments with workload trace and also real experiments on Amazon Web Services(AWS). The experimental results verify the effectiveness of the proposed modelling approach and scheduling strategies. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.future.2017.07.043 | Future Generation Computer Systems |
Keywords | Field | DocType |
Data centre,Scheduling,Game theory,Resource conflict | Lottery scheduling,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Journal |
Volume | ISSN | Citations |
86 | 0167-739X | 1 |
PageRank | References | Authors |
0.35 | 33 | 9 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Wang | 1 | 1 | 0.35 |
| Chao Chen | 2 | 2032 | 185.26 |
| Ligang He | 3 | 542 | 56.73 |
| Bo Gao | 4 | 36 | 5.68 |
| Jiadong Ren | 5 | 39 | 12.15 |
| Zhangjie Fu | 6 | 405 | 19.78 |
| Songling Fu | 7 | 12 | 2.89 |
| Yongjian Hu | 8 | 502 | 30.74 |
| Chang-Tsun Li | 9 | 937 | 72.14 |