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] Research on k-means Clustering Algorithm An Improved k-means Clustering Algorithm
    Shi Na
    Liu Xumin
    Guan Yong
    2010 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY AND SECURITY INFORMATICS (IITSI 2010), 2010, : 63 - 67
  • [42] K-Means Clustering Over a Large, Dynamic Network
    Datta, Souptik
    Giannella, Chris
    Kargupta, Hillol
    PROCEEDINGS OF THE SIXTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2006, : 153 - 164
  • [43] Parallel Implementation of Improved K-Means Based on a Cloud Platform
    Zhang, Shufen
    Chen, Xuebin
    Liu, Zhiyu
    Luo, Changyin
    INFORMATION TECHNOLOGY AND CONTROL, 2019, 48 (04): : 673 - 681
  • [44] Cloud implementation of the K-means algorithm for hyperspectral image analysis
    Juan Mario Haut
    Mercedes Paoletti
    Javier Plaza
    Antonio Plaza
    The Journal of Supercomputing, 2017, 73 : 514 - 529
  • [45] Analysis of K-means Algorithm For VM Allocation in Cloud Computing
    Adrian, Bramantyo
    Heryawan, Lukman
    2015 INTERNATIONAL CONFERENCE ON DATA AND SOFTWARE ENGINEERING (ICODSE), 2015, : 48 - 53
  • [46] Colour transformations and K-means segmentation for automatic cloud detection
    Blazek, Martin
    Pata, Petr
    METEOROLOGISCHE ZEITSCHRIFT, 2015, 24 (05) : 503 - 509
  • [47] Cloud implementation of the K-means algorithm for hyperspectral image analysis
    Mario Haut, Juan
    Paoletti, Mercedes
    Plaza, Javier
    Plaza, Antonio
    JOURNAL OF SUPERCOMPUTING, 2017, 73 (01): : 514 - 529
  • [48] Cluster-based Task Scheduling Using K-Means Clustering for Load Balancing in Cloud Datacenters
    Muthusamy, Geetha
    Chandran, Suganthe Ravi
    JOURNAL OF INTERNET TECHNOLOGY, 2021, 22 (01): : 121 - 130
  • [49] Network resource personalized recommendation based on K-means clustering
    Wang, Xin
    Huang, Zhong-Yi
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2014, 37 (SUPPL.): : 120 - 124
  • [50] Point Cloud Simplification Algorithm Based on Improved Bald Eagle Search and K-Means Clustering Iteration
    Niu H.
    Li F.
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 2024, 58 (02): : 172 - 183