Cited by 138Cloud Computing and Resource ManagementEnergy Efficiency in ComputingDistributed and Parallel Computing Systems

The DOI matches its Crossref record; 47 of the 49 references it cites were found in a registry or an index.

Biobjective Task Scheduling for Distributed Green Data Centers

Yuan, Haitao, Bi, Jing, Zhou, MengChu, Liu, Qing, Ammari, Ahmed Chiheb·2021·IEEE Transactions on Automation Science and Engineering

Abstract

The industry of data centers is the fifth largest energy consumer in the world. Distributed green data centers (DGDCs) consume 300 billion kWh per year to provide different types of heterogeneous services to global users. Users around the world bring revenue to DGDC providers according to actual quality of service (QoS) of their tasks. Their tasks are delivered to DGDCs through multiple Internet service providers (ISPs) with different bandwidth capacities and unit bandwidth price. In addition, prices of power grid, wind, and solar energy in different GDCs vary with their geographical locations. Therefore, it is highly challenging to schedule tasks among DGDCs in a high-profit and high-QoS way. This work designs a multiobjective optimization method for DGDCs to maximize the profit of DGDC providers and minimize the average task loss possibility of all applications by jointly determining the split of tasks among multiple ISPs and task service rates of each GDC. A problem is formulated and solved with a simulated-annealing-based biobjective differential evolution (SBDE) algorithm to obtain an approximate Pareto-optimal set. The method of minimum Manhattan distance is adopted to select a knee solution that specifies the Pareto-optimal task service rates and task split among ISPs for DGDCs in each time slot. Real-life data-based experiments demonstrate that the proposed method achieves lower task loss of all applications and larger profit than several existing scheduling algorithms. Note to Practitioners-This work aims to maximize the profit and minimize the task loss for DGDCs powered by renewable energy and smart grid by jointly determining the split of tasks among multiple ISPs. Existing task scheduling algorithms fail to jointly consider and optimize the profit of DGDC providers and QoS of tasks. Therefore, they fail to intelligently schedule tasks of heterogeneous applications and allocate infrastructure resources within their response time bounds. In this work, a new method that tackles drawbacks of existing algorithms is proposed. It is achieved by adopting the proposed SBDE algorithm that solves a multiobjective optimization problem. Simulation experiments demonstrate that compared with three typical task scheduling approaches, it increases profit and decreases task loss. It can be readily and easily integrated and implemented in real-life industrial DGDCs. The future work needs to investigate the real-time green energy prediction with historical data and further combine prediction and task scheduling together to achieve greener and even net-zero-energy data centers.

Overview

Integrity signals

Registry

Crossref · 10.1109/tase.2019.2958979

Cites

47 of 47 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 49 references

Research works printed but not linked: 1

  1. juarez, 2018, Energy-aware scheduler for HPC parallel task base applications in cloud computing, Int J Combinat Optim Problems Inform, 9, 54

Cited by

Sorted by citations

Metadata

Authors
Yuan, H., Bi, J., Zhou, M., Liu, Q., & Ammari, A. C.
Affiliations
  • New Jersey Institute of Technology (US)
  • Beijing University of Technology (CN)
  • Sultan Qaboos University (OM)
Venue
IEEE Transactions on Automation Science and Engineering
Published
2021-04
Volume
18
Issue
2
Pages
731-742
ISSN
  • 1545-5955 (ISSN-L)
  • 1558-3783
OpenAlex
W3000090293
Cited by
138
References
49
Citations by year
2026: 10 · 2025: 16 · 2024: 17 · 2023: 23 · 2022: 21 · 2021: 25
FWCI
22.34
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Automation Science and Engineering (publishedVersion)
Funders
  • National Natural Science Foundation of China (61802015, 61703011)
  • Major Science and Technology Program for Water Pollution Control and Treatment of China (2018ZX07111005)
  • National Defense Pre-Research Foundation of China (41401020401, 41401050102)
  • Sultan Qaboos University through the Omantel Research Program (EG/SQU-OT/19/04)
Topics
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
  • Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed and Parallel Computing Systems
Keywords
task scheduling, bi-objective optimization, simulated annealing, differential evolution, Pareto front, quality of service, renewable energy, smart grid, internet service providers, task decomposition, multi-objective optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review