Fast and QoS-Aware Heterogeneous Data Center Scheduling Using Locality Sensitive Hashing

被引:0
|
作者
Islam, Mohammad Shahedul [1 ]
Gibson, Matt [1 ]
Muzahid, Abdullah [1 ]
机构
[1] Univ Texas San Antonio, San Antonio, TX 78249 USA
关键词
D O I
10.1109/CloudCom.2015.88
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
As cloud becomes a cost effective computing platform, improving its utilization becomes a critical issue. Determining an incoming application's sensitivity toward various resources is one of the major challenges to obtain higher utilization. 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 and scheduling 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 and scheduling based on Locality Sensitive Hashing (LSH). Given a set of n points in a d-dimensional Euclidean space, LSH is a hashing technique such that points nearby are hashed to the same "bucket" and points that are far apart are hashed to different buckets. This data structure allows approximate nearest neighbor queries to be executed with nearly asymptotically optimal running time. This allows us to perform workload profiling quickly with high accuracy and scheduling in heterogeneous data centers with high quality of service (QoS) and utilization.
引用
收藏
页码:74 / 81
页数:8
相关论文
共 50 条
  • [31] An enhanced throughput and QoS-aware scheduling policy for Bluetooth
    Chang, Y
    Park, SC
    Lee, S
    2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: BROADBAND WIRELESS - THE TIME IS NOW, 2004, : 1004 - 1007
  • [32] QoS-aware downlink packet scheduling for LTE networks
    Lai, Wei Kuang
    Tang, Chang-Lung
    COMPUTER NETWORKS, 2013, 57 (07) : 1689 - 1698
  • [33] QoS-aware scheduling of Workflows in Cloud Computing environments
    Bousselmi, Khadija
    Brahmi, Zaki
    Gammoudi, Mohamed Mohsen
    IEEE 30TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS IEEE AINA 2016, 2016, : 737 - 745
  • [34] QoS-aware routing in emerging heterogeneous wireless networks
    Yang, Kun
    Wu, Yumin
    Chen, Hsiao-Hwa
    IEEE COMMUNICATIONS MAGAZINE, 2007, 45 (02) : 74 - 80
  • [35] QoS-Aware Fault-Tolerant Scheduling for Real-Time Tasks on Heterogeneous Clusters
    Zhu, Xiaomin
    Qin, Xiao
    Qiu, Meikang
    IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (06) : 800 - 812
  • [36] InferFair: Towards QoS-aware scheduling for performance isolation guarantee in heterogeneous model serving systems
    Peng, Yaqiong
    Peng, Haocheng
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2024, 150 : 10 - 20
  • [37] Towards QoS-aware Load Distribution In Heterogeneous Networks
    Niephaus, Christian
    Kretschmer, Mathias
    Ghinea, Gheorghita
    2013 IEEE MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS (MICC), 2013, : 151 - 156
  • [38] PowerMorph: QoS-Aware Server Power Reshaping for Data Center Regulation Service
    Jahanshahi, Ali
    Yu, Nanpeng
    Wong, Daniel
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2022, 19 (03)
  • [39] Bayesian Locality Sensitive Hashing for Fast Similarity Search
    Satuluri, Venu
    Parthasarathy, Srinivasan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (05): : 430 - 441
  • [40] A Locality Sensitive Hashing Technique for Categorical Data
    Lee, Kyung Mi
    Lee, Keon Myung
    INDUSTRIAL INSTRUMENTATION AND CONTROL SYSTEMS, PTS 1-4, 2013, 241-244 : 3159 - 3164