The what, The from, and The to: The Migration Games in Deduplicated Systems

被引:0
|
作者
Kisous, Roei [1 ]
Kolikant, Ariel [1 ]
Duggal, Abhinav [2 ]
Sheinvald, Sarai [3 ]
Yadgar, Gala [1 ]
机构
[1] Technion, Comp Sci Dept, Haifa, Israel
[2] DELL EMC, Round Rock, TX USA
[3] ORT Braude Coll Engn, Karmiel, Israel
基金
以色列科学基金会;
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Deduplication reduces the size of the data stored in large-scale storage systems by replacing duplicate data blocks with references to their unique copies. This creates dependencies between files that contain similar content, and complicates the management of data in the system. In this paper, we address the problem of data migration, where files are remapped between different volumes as a result of system expansion or maintenance. The challenge of determining which files and blocks to migrate has been studied extensively for systems without deduplication. In the context of deduplicated storage, however, only simplified migration scenarios were considered. In this paper, we formulate the general migration problem for deduplicated systems as an optimization problem whose objective is to minimize the system's size while ensuring that the storage load is evenly distributed between the system's volumes, and that the network traffic required for the migration does not exceed its allocation. We then present three algorithms for generating effective migration plans, each based on a different approach and representing a different tradeoff between computation time and migration efficiency. Our greedy algorithm provides modest space savings, but is appealing thanks to its exceptionally short runtime. Its results can be improved by using larger system representations. Our theoretically optimal algorithm formulates the migration problem as an ILP (integer linear programming) instance. Its migration plans consistently result in smaller and more balanced systems than those of the greedy approach, although its runtime is long and, as a result, the theoretical optimum is not always found. Our clustering algorithm enjoys the best of both worlds: its migration plans are comparable to those generated by the ILP-based algorithm, but its runtime is shorter, sometimes by an order of magnitude. It can be further accelerated at a modest cost in the quality of its results.
引用
收藏
页码:265 / 280
页数:16
相关论文
共 50 条
  • [21] What Is Your Quest? From Adventure Games to Interactive Books
    Colatrella, Carol
    AMERICAN LITERATURE, 2015, 87 (03) : 630 - 632
  • [22] What is migration?
    Dingle, Hugh
    Drake, V. Alistair
    BIOSCIENCE, 2007, 57 (02) : 113 - 121
  • [23] What we learned from the Mexican migration project
    Durand, J
    Massey, DS
    CROSSING THE BORDER: RESEARCH FROM THE MEXICAN MIGRATION PROJECT, 2004, : 1 - 14
  • [24] Games and the Rise of Systems Thinking: From Models to Machines
    Pizelo, Samuel
    REPRESENTATIONS, 2024, 165 (01) : 92 - 119
  • [25] The Role of Opportunistic Migration in Cyclic Games
    Buesser, Pierre
    Tomassini, Marco
    PLOS ONE, 2014, 9 (06):
  • [26] Opportunistic migration in spatial evolutionary games
    Buesser, Pierre
    Tomassini, Marco
    Antonioni, Alberto
    PHYSICAL REVIEW E, 2013, 88 (04):
  • [27] What Stuff Games are Made of?
    Kirichenko, Vladislav V.
    GALACTICA MEDIA-JOURNAL OF MEDIA STUDIES - GALAKTIKA MEDIA-ZHURNAL MEDIA ISSLEDOVANIJ, 2024, 6 (03): : 376 - 389
  • [28] War games - what are they good for?
    Adkins, Melanie
    PSYCHOLOGIST, 2007, 20 (11) : 684 - 684
  • [29] RepEC-Duet: Ensure High Reliability and Performance for Deduplicated and Delta-Compressed Storage Systems
    Zuo, Chunxue
    Fang, Wang
    Huang, Ping
    Hu, Yuchong
    Feng, Dan
    2019 IEEE 37TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD 2019), 2019, : 190 - 198
  • [30] Policy Discourses on Irregular Migration in the EU - 'Number Games' and 'Political Games'
    Vollmer, Bastian A.
    EUROPEAN JOURNAL OF MIGRATION AND LAW, 2011, 13 (03) : 317 - 339