Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers

Jing Bi, Haitao Yuan, Jia Zhang, Mengchu Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A growing number of global companies select Green Cloud Data Centers (GCDCs) to manage their delay-constrained applications. The fast growth of users' tasks dramatically increases the energy consumed by GCDC, e.g., Google. The random nature of tasks brings a big challenge of scheduling tasks of each application with limited infrastructure resources of GCDCs. This work accurately computes a mathematical relation between task service rates and the number of tasks refusal in GCDC. Besides, it proposes a Temporal Task Scheduling (TTS) algorithm investigating the temporal variation in geo-distributed cloud data centers to schedule all tasks within their delay constraints. Furthermore, a novel dynamic hybrid meta-heuristic algorithm is developed for the formulated profit maximization problem, based on genetic simulated annealing and particle swarm optimization. The proposed algorithm can guarantee that differentiated service qualities can be provided with higher overall performance and lower energy cost. Trace-driven simulations demonstrate that larger throughput and profit is achieved than several existing scheduling algorithms.

Original languageEnglish (US)
Title of host publicationProceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services
PublisherIEEE Computer Society
Pages138-145
Number of pages8
ISBN (Electronic)9781538672358
DOIs
StatePublished - Sep 7 2018
Event11th IEEE International Conference on Cloud Computing, CLOUD 2018 - San Francisco, United States
Duration: Jul 2 2018Jul 7 2018

Publication series

NameIEEE International Conference on Cloud Computing, CLOUD
Volume2018-July

Other

Other11th IEEE International Conference on Cloud Computing, CLOUD 2018
CountryUnited States
CitySan Francisco
Period7/2/187/7/18

Fingerprint

Scheduling algorithms
Profitability
Scheduling
Heuristic algorithms
Simulated annealing
Particle swarm optimization (PSO)
Throughput
Costs
Industry

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence
  • Information Systems

Cite this

Bi, J., Yuan, H., Zhang, J., & Zhou, M. (2018). Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers. In Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services (pp. 138-145). [8457793] (IEEE International Conference on Cloud Computing, CLOUD; Vol. 2018-July). IEEE Computer Society. https://doi.org/10.1109/CLOUD.2018.00025
Bi, Jing ; Yuan, Haitao ; Zhang, Jia ; Zhou, Mengchu. / Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers. Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services. IEEE Computer Society, 2018. pp. 138-145 (IEEE International Conference on Cloud Computing, CLOUD).
@inproceedings{5c2bfee9f43c4b6e951269c1927a955d,
title = "Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers",
abstract = "A growing number of global companies select Green Cloud Data Centers (GCDCs) to manage their delay-constrained applications. The fast growth of users' tasks dramatically increases the energy consumed by GCDC, e.g., Google. The random nature of tasks brings a big challenge of scheduling tasks of each application with limited infrastructure resources of GCDCs. This work accurately computes a mathematical relation between task service rates and the number of tasks refusal in GCDC. Besides, it proposes a Temporal Task Scheduling (TTS) algorithm investigating the temporal variation in geo-distributed cloud data centers to schedule all tasks within their delay constraints. Furthermore, a novel dynamic hybrid meta-heuristic algorithm is developed for the formulated profit maximization problem, based on genetic simulated annealing and particle swarm optimization. The proposed algorithm can guarantee that differentiated service qualities can be provided with higher overall performance and lower energy cost. Trace-driven simulations demonstrate that larger throughput and profit is achieved than several existing scheduling algorithms.",
author = "Jing Bi and Haitao Yuan and Jia Zhang and Mengchu Zhou",
year = "2018",
month = "9",
day = "7",
doi = "https://doi.org/10.1109/CLOUD.2018.00025",
language = "English (US)",
series = "IEEE International Conference on Cloud Computing, CLOUD",
publisher = "IEEE Computer Society",
pages = "138--145",
booktitle = "Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services",
address = "United States",

}

Bi, J, Yuan, H, Zhang, J & Zhou, M 2018, Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers. in Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services., 8457793, IEEE International Conference on Cloud Computing, CLOUD, vol. 2018-July, IEEE Computer Society, pp. 138-145, 11th IEEE International Conference on Cloud Computing, CLOUD 2018, San Francisco, United States, 7/2/18. https://doi.org/10.1109/CLOUD.2018.00025

Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers. / Bi, Jing; Yuan, Haitao; Zhang, Jia; Zhou, Mengchu.

Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services. IEEE Computer Society, 2018. p. 138-145 8457793 (IEEE International Conference on Cloud Computing, CLOUD; Vol. 2018-July).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers

AU - Bi, Jing

AU - Yuan, Haitao

AU - Zhang, Jia

AU - Zhou, Mengchu

PY - 2018/9/7

Y1 - 2018/9/7

N2 - A growing number of global companies select Green Cloud Data Centers (GCDCs) to manage their delay-constrained applications. The fast growth of users' tasks dramatically increases the energy consumed by GCDC, e.g., Google. The random nature of tasks brings a big challenge of scheduling tasks of each application with limited infrastructure resources of GCDCs. This work accurately computes a mathematical relation between task service rates and the number of tasks refusal in GCDC. Besides, it proposes a Temporal Task Scheduling (TTS) algorithm investigating the temporal variation in geo-distributed cloud data centers to schedule all tasks within their delay constraints. Furthermore, a novel dynamic hybrid meta-heuristic algorithm is developed for the formulated profit maximization problem, based on genetic simulated annealing and particle swarm optimization. The proposed algorithm can guarantee that differentiated service qualities can be provided with higher overall performance and lower energy cost. Trace-driven simulations demonstrate that larger throughput and profit is achieved than several existing scheduling algorithms.

AB - A growing number of global companies select Green Cloud Data Centers (GCDCs) to manage their delay-constrained applications. The fast growth of users' tasks dramatically increases the energy consumed by GCDC, e.g., Google. The random nature of tasks brings a big challenge of scheduling tasks of each application with limited infrastructure resources of GCDCs. This work accurately computes a mathematical relation between task service rates and the number of tasks refusal in GCDC. Besides, it proposes a Temporal Task Scheduling (TTS) algorithm investigating the temporal variation in geo-distributed cloud data centers to schedule all tasks within their delay constraints. Furthermore, a novel dynamic hybrid meta-heuristic algorithm is developed for the formulated profit maximization problem, based on genetic simulated annealing and particle swarm optimization. The proposed algorithm can guarantee that differentiated service qualities can be provided with higher overall performance and lower energy cost. Trace-driven simulations demonstrate that larger throughput and profit is achieved than several existing scheduling algorithms.

UR - http://www.scopus.com/inward/record.url?scp=85057505820&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057505820&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/CLOUD.2018.00025

DO - https://doi.org/10.1109/CLOUD.2018.00025

M3 - Conference contribution

T3 - IEEE International Conference on Cloud Computing, CLOUD

SP - 138

EP - 145

BT - Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services

PB - IEEE Computer Society

ER -

Bi J, Yuan H, Zhang J, Zhou M. Temporal Task Scheduling for Delay-Constrained Applications in Geo-Distributed Cloud Data Centers. In Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services. IEEE Computer Society. 2018. p. 138-145. 8457793. (IEEE International Conference on Cloud Computing, CLOUD). https://doi.org/10.1109/CLOUD.2018.00025