arrow
Return

Entropy4Cloud: Using Entropy-Based Complexity to Optimize Cloud Service Resource Management

delete2018-02-01
delete6
delete
OA
AI
H
Huankai Chen *
F
Frank Z. Wang
N
Na Helian
DOI:10.1109/TETCI.2017.2755691delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In cloud service resource management system, complexity limits the system's ability to better satisfy the application's quality of service requirements, e.g., cost budget, average response time, and reliability. Numerousness, diversity, variety, uncertainty, etc., are some of the complexity factors that lead to the variation between expected plan and actual running performance of cloud applications. In this paper, after defining the complexity clearly, we identify the origin of complexity in cloud service resource management system through the study of Local Activity Principle. In order to manage complexity, an entropy-based methodology is presented to use, which covers identifying, measuring, analyzing, and controlling (avoid and reduce) of complexity. Finally, we implement such idea in a popular cloud engine, Apache Spark, for running analysis as a service. Experiments demonstrate that the new entropy-based resource management approach can significantly improve the performance of spark applications. Compare with the fair scheduler in Apache Spark, our proposed entropy scheduler is able to reduce overall cost by 23%, improve the average service response time by 15-20%, and minimized the standard deviation of service response time by 30-45%.
Keywords:
Entropy theory
complexity
cloud services
resource management
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

I
IEEE Transactions on Emerging Topics in Computational Intelligence
IF:
6.5
Papers:
1.4K
Citations:
4.5K

Organization

U
University of Hertfordshire
Scholars:
4.0K
Papers: 4.4K
Citations: 6.8K
U
University of Kent
Scholars:
5.3K
Papers: 6.1K
Citations: 8.1K