Temporal-variation-aware profit-maximized and delay-bounded task scheduling in green data center

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An increasing number of enterprises deploy their business applications in green data centers (GDCs) to address irregular and drastic natures in task arrival of global users. GDCs aim to schedule tasks in the most cost-effective way, and achieve the profit maximization by increasing green energy usage and reducing brown one. However, prices of power grid, revenue, solar and wind energy vary dynamically within tasks’ delay constraints, and this brings a high challenge to maximize the profit of GDCs such that their delay constraints are strictly met. Different from existing studies, a Temporal-variation-aware Profit-maximized Task Scheduling (TPTS) algorithm is proposed to consider dynamic differences, and intelligently schedule all tasks to GDCs within their delay constraints. In each interval, TPTS solves a constrained profit maximization problem by a novel Simulated-annealing-based Chaotic Particle swarm optimization (SCP). Compared to several state-of-the-art scheduling algorithms, TPTS significantly increases throughput and profit while strictly meeting tasks’ delay constraints.

Cite

CITATION STYLE

APA

Yuan, H., Bi, J., & Zhou, M. C. (2019). Temporal-variation-aware profit-maximized and delay-bounded task scheduling in green data center. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11874 LNCS, pp. 203–212). Springer. https://doi.org/10.1007/978-3-030-34914-1_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free