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 条
  • [41] Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search
    Christiani, Tobias
    SIMILARITY SEARCH AND APPLICATIONS (SISAP 2019), 2019, 11807 : 3 - 17
  • [42] Diverse Yet Efficient Retrieval using Locality Sensitive Hashing
    Rao, Vidyadhar
    Jain, Prateek
    Jawahar, C. V.
    ICMR'16: PROCEEDINGS OF THE 2016 ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA RETRIEVAL, 2016, : 189 - 196
  • [43] Correlated Locality-Sensitive Hashing
    Pagh, Rasmus
    ALGORITHMS - ESA 2015, 2015, 9294
  • [44] Compressing Locality Sensitive Hashing Tables
    Santoyo, Francisco
    Chavez, Edgar
    Tellez, Eric S.
    2013 MEXICAN INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE (ENC 2013), 2013, : 41 - 46
  • [45] Fast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashing
    Pan, Jia
    Manocha, Dinesh
    INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2016, 35 (12): : 1477 - 1496
  • [46] A fast online learning algorithm of radial basis function network with locality sensitive hashing
    Ali S.H.A.
    Fukase K.
    Ozawa S.
    Evolving Systems, 2016, 7 (3) : 173 - 186
  • [47] Fast distributed video deduplication via locality-sensitive hashing with similarity ranking
    Li, Yeguang
    Hu, Liang
    Xia, Ke
    Luo, Jie
    EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING, 2019, 2019 (1)
  • [48] Fast distributed video deduplication via locality-sensitive hashing with similarity ranking
    Yeguang Li
    Liang Hu
    Ke Xia
    Jie Luo
    EURASIP Journal on Image and Video Processing, 2019
  • [49] Toward Fast Niching Evolutionary Algorithms: A Locality Sensitive Hashing-Based Approach
    Zhang, Yu-Hui
    Gong, Yue-Jiao
    Zhang, Hua-Xiang
    Gu, Tian-Long
    Zhang, Jun
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (03) : 347 - 362
  • [50] EFFICIENT MANIFOLD LEARNING FOR SPEECH RECOGNITION USING LOCALITY SENSITIVE HASHING
    Tomar, Vikrant Singh
    Rose, Richard C.
    2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 6995 - 6999