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
来源
2015 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2015 IEEE 7TH INTERNATIONAL SYMPOSIUM ON CYBERSPACE SAFETY AND SECURITY, AND 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS (ICESS) | 2015年
关键词
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] Reducing Annotation Effort in Automatic Essay Evaluation Using Locality Sensitive Hashing
    Tashu, Tsegaye Misikir
    Szabo, David
    Horvath, Tomas
    INTELLIGENT TUTORING SYSTEMS (ITS 2019), 2019, 11528 : 186 - 192
  • [42] Omnibus outlier detection in sensor networks using windowed locality sensitive hashing
    Giatrakos, Nikos
    Deligiannakis, Antonios
    Garofalakis, Minos
    Kotidis, Yannis
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 110 : 587 - 609
  • [43] EFFICIENT MANIFOLD PRESERVING AUDIO SOURCE SEPARATION USING LOCALITY SENSITIVE HASHING
    Kim, Minje
    Smaragdis, Paris
    Mysore, Gautham J.
    2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP), 2015, : 479 - 483
  • [44] Using Locality-Sensitive Hashing for SVM Classification of Large Data Sets
    Gonzalez-Lima, Maria D.
    Ludena, Carenne C.
    MATHEMATICS, 2022, 10 (11)
  • [45] Image super resolution using distributed locality sensitive hashing for manifold learning
    Tripathi, Anurag
    Gupta, Abhinav
    Chaudhury, Santanu
    Singh, Arun
    MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (18) : 25673 - 25684
  • [46] Query by Humming by Using Locality Sensitive Hashing based on Combination of Pitch and Note
    Wang, Qiang
    Guo, Zhiyuan
    Liu, Gang
    Guo, Jun
    Lu, Yueming
    2012 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO WORKSHOPS (ICMEW), 2012, : 302 - 307
  • [47] Estimating user response rate using locality sensitive hashing in search marketing
    Maryam Almasharawi
    Ahmet Bulut
    Electronic Commerce Research, 2022, 22 : 37 - 51
  • [48] Image super resolution using distributed locality sensitive hashing for manifold learning
    Anurag Tripathi
    Abhinav Gupta
    Santanu Chaudhury
    Arun Singh
    Multimedia Tools and Applications, 2019, 78 : 25673 - 25684
  • [49] Locality Sensitive Hashing for Efficient Similar Polygon Retrieval
    Kaplan, Haim
    Tenenbaum, Jay
    38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
  • [50] Real-time recommendation with locality sensitive hashing
    Aytekin, Ahmet Maruf
    Aytekin, Tevfik
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2019, 53 (01) : 1 - 26