首页> 外文会议>IEEE International Performance Computing and Communications Conference >ThinDedup: An I/O Deduplication Scheme that Minimizes Efficiency Loss due to Metadata Writes
【24h】

ThinDedup: An I/O Deduplication Scheme that Minimizes Efficiency Loss due to Metadata Writes

机译:Thindedup:一种I / O重复数据删除方案,可根据元数据写入最小化效率损失

获取原文

摘要

I/O deduplication is an important technique for saving I/O bandwidth and storage space for storage systems. However, it requires a new level of address mapping, and consequently needs to maintain corresponding metadata. To meet requirements on data persistency and consistency, the metadata writing is likely to make deduplication operations much fatter, in terms of amount of additional writes on the critical I/O path, than one might expect. In this paper we propose to compress the data and insert metadata into data blocks to reduce metadata writes. Assuming that performance-critical data are usually compressible, we can mostly remove separate writes of metadata out of the critical path of servicing users' requests, and make I/O deduplication much thinner. Accordingly we name the scheme ThinDedup. In addition to metadata insertion, ThinDedup also uses persistency of data fingerprints to evade enforcement of write order between data and metadata. We have implemented ThinDedup in the Linux kernel as a device mapper target to provide block-level deduplication. Experimental results show, compared to existing deduplication schemes, ThinDedup achieves (much) higher (up to 3X) I/O throughput and lower latency (reduced by up to 88%) without compromising data persistency.
机译:I / O重复数据删除是保存存储系统I / O带宽和存储空间的重要技术。但是,它需要新的地址映射水平,因此需要维护相应的元数据。为了满足数据持久性和一致性的要求,在关键I / O路径上的额外写入量的情况下,元数据写入可能会使重复数据删除操作变得更加多样化,而不是一个可能期望的。在本文中,我们建议压缩数据并将元数据插入数据块以减少元数据写入。假设性能关键数据通常是可压缩的,我们最多可以从维修用户请求的关键路径中删除单独的元数据写入,并使I / O重复数据删除更薄。因此,我们将该方案命名为Thindedup。除了元数据插入之外,Thindedup还使用数据指纹的持久性来逃避数据和元数据之间的写入订单的执行。我们在Linux内核中实现了Thindedup作为设备映射器目标,以提供块级重复数据删除。实验结果表明,与现有的重复数据删除方案相比,Thindedup达到(多于3倍)I / O吞吐量和降低延迟(减少高达88%)而不会影响数据持久性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号