Compass: Cost of migration-aware placement in storage systems

被引:0
|
作者
Verma, Akshat
Sharma, Upendra
Jain, Rohit
Daseupta, Koustuv
机构
关键词
D O I
10.1109/INM.2007.374769
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We investigate metbodologies for placement and migration of logical data stores in virtualized storage systems leading to optimum system configuration in a dynamic workload scenario. The aim is to optimize the tradeoff between the performance or operational cost improvement resulting from changes in store placement. and the cost imposed by the involved data migration step. We propose a unified economic utility based framework in which the tradeoff can he formulated as a utility maximization problem where the utility of a configuration is defined as the difference between the benefit of a configuration and the cost of moving to the configuration. We present a storage management middleware framework and architecture Compass that allows systems designers to plug-in different placement as well as migration techniques for estimation of utilities associated with different configurations. The biggest obstacle in optimizing the placement benefit and migration cost tradeoff is the exponential number of possible configurations that one may have to evaluate. We present algorithms that explore the configuration space efficiently and compute a candidate set of configurations that optimize this cost-benefit tradeoff. Our algorithms have many desirable properties including local optimality. Comprehensive experimental studies demonstrate the efficacy of the proposed framework and exploration algorithms, as our algorithms outperform migration cost-oblivious placement strategies by upto 40% on real OLTP traces for many settings.
引用
收藏
页码:50 / 59
页数:10
相关论文
共 50 条
  • [1] Migration-Aware Virtual Machine Placement for Cloud Data Centers
    Wang, Xiumin
    Yuen, Chau
    Ul Hassan, Naveed
    Wang, Wei
    Chen, Tian
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOP (ICCW), 2015, : 1940 - 1945
  • [2] Migration-Aware Genetic Optimization for MapReduce Scheduling and Replica Placement in Hadoop
    Carlos Guerrero
    Isaac Lera
    Carlos Juiz
    [J]. Journal of Grid Computing, 2018, 16 : 265 - 284
  • [3] Migration-Aware Genetic Optimization for MapReduce Scheduling and Replica Placement in Hadoop
    Guerrero, Carlos
    Lera, Isaac
    Juiz, Carlos
    [J]. JOURNAL OF GRID COMPUTING, 2018, 16 (02) : 265 - 284
  • [4] Implementing Migration-Aware Virtual Machines
    Al-Said, Taimur
    Rana, Omer
    [J]. 2015 IEEE 2ND INTERNATIONAL CONFERENCE ON CYBER SECURITY AND CLOUD COMPUTING (CSCLOUD), 2015, : 54 - 61
  • [5] pMapper: Power and Migration Cost Aware Application Placement in Virtualized Systems
    Verma, Akshat
    Ahuja, Puneet
    Neogi, Anindya
    [J]. MIDDLEWARE 2008, PROCEEDINGS, 2008, 5346 : 243 - 264
  • [6] Efficient Migration-Aware Algorithms for Elastic BPMaaS
    Rosinosky, Guillaume
    Youcef, Samir
    Charoy, Francois
    [J]. BUSINESS PROCESS MANAGEMENT, BPM 2017, 2017, 10445 : 147 - 163
  • [7] Migration-Aware Network Services With Edge Computing
    Mukhopadhyay, Atri
    Iosifidis, George
    Ruffini, Marco
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2022, 19 (02): : 1458 - 1471
  • [8] Migration-Aware Loop Retiming for STT-RAM-Based Hybrid Cache in Embedded Systems
    Qiu, Keni
    Zhao, Mengying
    Li, Qingan
    Fu, Chenchen
    Xue, Chun Jason
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2014, 33 (03) : 329 - 342
  • [9] Migration-aware Loop Retiming for STT-RAM based Hybrid Cache for Embedded Systems
    Qiu, Keni
    Zhao, Mengying
    Fu, Chenchen
    Shi, Liang
    Xue, Chun Jason
    [J]. PROCEEDINGS OF THE 2013 IEEE 24TH INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 13), 2013, : 83 - 86
  • [10] Migration-aware adaptive MPSoC static schedules with dynamic reconfigurability
    Zhang, Yuping
    Xue, Chun Jason
    Yang, Chengmo
    Orailoglu, Alex
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (10) : 1400 - 1410