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 条
  • [21] Fast anomaly detection with locality-sensitive hashing and hyperparameter autotuning
    Meira, Jorge
    Eiras-Franco, Carlos
    Bolon-Canedo, Veronica
    Marreiros, Goreti
    Alonso-Betanzos, Amparo
    INFORMATION SCIENCES, 2022, 607 : 1245 - 1264
  • [22] Fast Access for Star Catalog Based on Locality-Sensitive Hashing
    Zhu H.
    Liang B.
    Zhang T.
    Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 2018, 36 (05): : 988 - 994
  • [23] A Fast Word Retrieval Technique Based on Kernelized Locality Sensitive Hashing
    Mondal, Tanmoy
    Ragot, Nicolas
    Ramel, Jean-Yves
    Pal, Umapada
    2013 12TH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION (ICDAR), 2013, : 1195 - 1199
  • [24] An Efficient Recommender System Using Locality Sensitive Hashing
    Zhang, Kunpeng
    Fan, Shaokun
    Wang, Harry Jiannan
    PROCEEDINGS OF THE 51ST ANNUAL HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES (HICSS), 2018, : 780 - 789
  • [25] Fast Video Deduplication via Locality Sensitive Hashing with Similarity Ranking
    Li, Yeguang
    Xia, Ke
    8TH INTERNATIONAL CONFERENCE ON INTERNET MULTIMEDIA COMPUTING AND SERVICE (ICIMCS2016), 2016, : 94 - 98
  • [26] Fast and QoS-Aware Heterogeneous Data Center Scheduling Using Locality Sensitive Hashing
    Islam, Mohammad Shahedul
    Gibson, Matt
    Muzahid, Abdullah
    2015 IEEE 7TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM), 2015, : 74 - 81
  • [27] Multi-resolution sketches and locality sensitive hashing for fast trajectory processing
    Astefanoaei, Maria
    Cesaretti, Paul
    Katsikouli, Panagiota
    Goswami, Mayank
    Sarkar, Rik
    26TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2018), 2018, : 279 - 288
  • [28] Lower bounds on locality sensitive hashing
    Motwani, Rajeev
    Naor, Assaf
    Panigrahy, Rina
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (04) : 930 - 935
  • [29] MinIsoClust: Isoform clustering using minhash and locality sensitive hashing
    Behera, Sairam
    Deogun, Jitender S.
    Moriyama, Etsuko N.
    ACM-BCB 2020 - 11TH ACM CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY, AND HEALTH INFORMATICS, 2020,
  • [30] A Fast and Memory-Efficient Spectral Library Search Algorithm Using Locality-Sensitive Hashing
    Wang, Lei
    Liu, Kaiyuan
    Li, Sujun
    Tang, Haixu
    PROTEOMICS, 2020, 20 (21-22)