Fast and Accurate Workload Characterization Using Locality Sensitive Hashing

被引:0
|
作者
Islam, Mohammad Shahedul [1 ]
Gibson, Matt [1 ]
Muzahid, Abdullah [1 ]
机构
[1] Univ Texas San Antonio, Comp Sci, San Antonio, TX 78249 USA
关键词
Application characterization; data center; locality sensitive hashing;
D O I
10.1109/HPCC-CSS-ICESS.2015.249
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Embedded applications are increasingly offloading their computations to a cloud data center. Determining an incoming application's sensitivity toward various shared resources is a major challenge. To this end, previous research attempts to characterize an incoming application's sensitivity toward interference on various resources (Source of Interference or SoI, for short) of a cloud system. Due to time constraints, the application's sensitivity is profiled in detail for only a small number of SoI, and the sensitivities for the remaining SoI are approximated by capitalizing on knowledge about some of the applications (i.e. training set) currently running in the system. A key drawback of previous approaches is that they have attempted to minimize the total error of the estimated sensitivities; however, various SoI do not behave the same as each other. For example, a 10% error in the estimate of SoI A may dramatically effect the QoS of an application whereas a 10% error in the estimate of SoI B may have a marginal effect. In this paper, we present a new method for workload characterization that considers these important issues. First, we compute an acceptable error for each SoI based on its effect on QoS, and our goal is to characterize an application so as to maximize the number of SoI that satisfy this acceptable error. Then we present a new technique for workload characterization based on Locality Sensitive Hashing (LSH). Our approach performs better than a state-of-the-art technique in terms of error rate (1.33 times better).
引用
收藏
页码:1192 / 1201
页数:10
相关论文
共 50 条
  • [1] Fast Duplicate Detection Using Locality Sensitive Hashing
    Rong, C. T.
    Feng, L. J.
    [J]. INTERNATIONAL CONFERENCE ON ADVANCED EDUCATIONAL TECHNOLOGY AND INFORMATION ENGINEERING (AETIE 2015), 2015, : 580 - 588
  • [2] Fast Redescription Mining Using Locality-Sensitive Hashing
    Karjalainen, Maiju
    Galbrun, Esther
    Miettinen, Pauli
    [J]. MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES: RESEARCH TRACK, PT VII, ECML PKDD 2024, 2024, 14947 : 124 - 142
  • [3] CONSULT: accurate contamination removal using locality-sensitive hashing
    Rachtman, Eleonora
    Bafna, Vineet
    Mirarab, Siavash
    [J]. NAR GENOMICS AND BIOINFORMATICS, 2021, 3 (03)
  • [4] Fast Fuzzy Search for Mixed Data Using Locality Sensitive Hashing
    Lee, Kyung Mi
    Lee, Keon Myung
    [J]. PROGRESS IN MECHATRONICS AND INFORMATION TECHNOLOGY, PTS 1 AND 2, 2014, 462-463 : 321 - +
  • [5] Fast hierarchical clustering algorithm using locality-sensitive hashing
    Koga, H
    Ishibashi, T
    Watanabe, T
    [J]. DISCOVERY SCIENCE, PROCEEDINGS, 2004, 3245 : 114 - 128
  • [6] Locality Sensitive Hashing Using GMM
    Schmieder, Fabian
    Yang, Bin
    [J]. PATTERN RECOGNITION, GCPR 2014, 2014, 8753 : 569 - 581
  • [7] Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search
    Huang, Qiang
    Ma, Guihong
    Feng, Jianlin
    Fang, Qiong
    Tung, Anthony K. H.
    [J]. KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 1561 - 1570
  • [8] Bayesian Locality Sensitive Hashing for Fast Similarity Search
    Satuluri, Venu
    Parthasarathy, Srinivasan
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (05): : 430 - 441
  • [9] msCRUSH: Fast Tandem Mass Spectral Clustering Using Locality Sensitive Hashing
    Wang, Lei
    Li, Sujun
    Tang, Haixu
    [J]. JOURNAL OF PROTEOME RESEARCH, 2019, 18 (01) : 147 - 158
  • [10] Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing
    Koga, Hisashi
    Ishibashi, Tetsuo
    Watanabe, Toshinori
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2007, 12 (01) : 25 - 53