Name
Abstract | ||
|---|---|---|
Recent trends show that cloud computing is growing to span more and more globally distributed data centers. For geo-distributed data centers, there is an increasing need for scheduling algorithms to place tasks across data centers, by jointly considering data and computation. This scheduling must deal with situations such as wide-area distributed data, data sharing, WAN bandwidth costs and data center capacity limits, while also minimizing completion time. However, this kind of scheduling problems is known to be NP-Hard. In this paper, inspired by real applications in astronomy field, we propose a two-phase scheduling algorithm that addresses these challenges. The mapping phase groups tasks considering the data-sharing relations, and dispatches groups to data centers by way of one-to-one correspondence. The reassigning phase balances the completion time across data centers according to relations between tasks and groups. We utilize the real China-Astronomy-Cloud model and typical applications to evaluate our proposal. Simulations show that our algorithm obtains up to 22% better completion time and effectively reduces the amount of data transfers compared with other similar scheduling algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/CCGrid.2015.83 | Cluster Computing and the Grid |
Field | DocType | ISSN |
Data modeling,Fair-share scheduling,Scheduling (computing),Computer science,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Cloud computing,Distributed computing | Conference | 2376-4414 |
Citations | PageRank | References |
6 | 0.48 | 16 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lingyan Yin | 1 | 7 | 0.86 |
| Sun Jizhou | 2 | 253 | 47.07 |
| Zhao, L. | 3 | 14 | 4.00 |
| Chenzhou Cui | 4 | 15 | 5.24 |
| Jian Xiao | 5 | 24 | 9.12 |
| Ce Yu | 6 | 75 | 15.15 |