Dynamic K-Means Clustering of Workload and Cloud Resource Configuration for Cloud Elastic Model

被引:2
|
作者
Daradkeh, Tariq [1 ]
Agarwal, Anjali [1 ]
Zaman, Marzia [2 ]
Goel, Nishith [2 ]
机构
[1] Concordia Univ, Dept Elect & Comp Engn, Montreal, PQ, Canada
[2] Cistech Ltd, Ottawa, ON K2E 7K3, Canada
来源
IEEE ACCESS | 2020年 / 8卷
基金
加拿大自然科学与工程研究理事会;
关键词
Cloud computing; Data centers; Task analysis; Clustering methods; Servers; Internet; Hardware; Elastic model; kernel density estimator; dynamic k-means clustering; workload; data center configuration; logs analysis;
D O I
10.1109/ACCESS.2020.3042716
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud elasticity involves timely provisioning and de-provisioning of computing resources and adjusting resources size to meet the dynamic workload demand. This requires fast, and accurate resource scaling methods at minimum cost (e.g. pay as you go) that match with workload demands. Two dynamic changing parameters must be defined in an elastic model, the workload resource demand classes, and the data center resource reconfiguration classes. These parameters are not labeled for cloud management system while data center logs are being captured. Building an advance elastic model is a critical task, which defines multiple classes under these two categories i.e. for workload and for provisioning. A dynamic method is therefore required to define (during configuration time window) the workload classes and resource provisioning classes. Unsupervised learning model such as K-Means has many challenges such as time complexity, selection of optimum number of clusters (representing the classes), and determining centroid values of the clusters. All clustering methods depend on minimizing mean square error between center of population in same class member. These methods are often enhanced using guidelines to find out the centroids, but they suffer from K-Means limitations. For the application of clustering cloud log traces, most of the reported work use K-Means clustering to label workload types. However, there is no work reported that label data center scaling classes. In this work, a novel method is proposed to analyze the characteristics of both workloads and datacenter configurations using clustering method, and is based on random variable model transformation (kernel density estimator) guide. This method enhances K-Means clustering by automatically determining optimum number of classes and finding the mean centroids for the clusters. In addition, it improves the accuracy and the time complexity of standard K-Means clustering model, by best correlating between clustering attributes using statistical correlation methods.
引用
收藏
页码:219430 / 219446
页数:17
相关论文
共 50 条
  • [41] Workload-Adaptive Configuration Tuning for Hierarchical Cloud Schedulers
    Han, Rui
    Liu, Chi Harold
    Zong, Zan
    Chen, Lydia Y.
    Liu, Wending
    Wang, Siyi
    Zhan, Jianfeng
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (12) : 2879 - 2895
  • [42] Adaptive resource configuration for Cloud infrastructure management
    Maurer, Michael
    Brandic, Ivona
    Sakellariou, Rizos
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (02): : 472 - 487
  • [43] Cloud Network and Mathematical Model Calculation Scheme for Dynamic Big Data
    Chen, Yiren
    Qiu, Zhiyong
    IEEE ACCESS, 2020, 8 : 137322 - 137329
  • [44] Petri net model for resource scheduling with auto scaling in elastic cloud
    Remesh Babu K.R.
    Samuel P.
    Remesh Babu, K.R. (remeshbabu@yahoo.com), 1600, Inderscience Publishers, 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (22): : 462 - 477
  • [45] Centroid Update Approach to K-Means Clustering
    Borlea, Ioan-Daniel
    Precup, Radu-Emil
    Dragan, Florin
    Borlea, Alexandra-Bianca
    ADVANCES IN ELECTRICAL AND COMPUTER ENGINEERING, 2017, 17 (04) : 3 - 10
  • [46] A dynamic clustering algorithm for cloud computing
    Yang, Zhongxue
    Qin, Xiaolin
    Li, Wenrui
    Yang, Yingjie
    Information Technology Journal, 2013, 12 (18) : 4637 - 4641
  • [47] Deterministic Feature Selection for k-Means Clustering
    Boutsidis, Christos
    Magdon-Ismail, Malik
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (09) : 6099 - 6110
  • [48] A Dynamic Combinatorial Double Auction Model for Cloud Resource Allocation
    Li, Qihui
    Jia, Xiaohua
    Huang, Chuanhe
    Bao, Haizhou
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2023, 11 (03) : 2873 - 2884
  • [49] Towards a Heterogeneous and Elastic Cloud Service System With a Correlation-Based Universal Resource Matching Strategy
    Hu, Cheng
    Deng, Yuhui
    Luo, Wenyu
    Wei, Qingsong
    Min, Geyong
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2024, 17 (05) : 2931 - 2944
  • [50] EFection: Effectiveness Detection Technique for Clustering Cloud Workload Traces
    Ali, Shallaw Mohammed
    Kecskemeti, Gabor
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2024, 17 (01)