• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Hint-K: An Efficient Multilevel Cache Using K-Step Hints
【24h】

Hint-K: An Efficient Multilevel Cache Using K-Step Hints

机译：提示K：使用K步提示的高效多级缓存

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

I/O performance has been critical for large-scale distributed systems. Many approaches, including hint-based multilevel cache, have been proposed to smooth the gap between different levels. These solutions demote or promote cache blocks based on the latest history information, which is insufficient for applications where frequent demote and promote operations occur. In this paper, we propose a novel multilevel buffer cache using K-step hints (Hint-K) to improve the I/O performance of distributed systems. The basic idea is to promote a block from the lower level cache to the higher level(s) or demote a block vice versa based on the block's previous K-step promote or demote operations, which are referred to as K-step hints. If we make an analogy between Hint-K and LRU-K, then LRU-K keeps track of the times of last K references for blocks within a single cache level, while our Hint-K keeps track of the information of the last K movements (either demote or promote) of blocks among different cache levels. We develop our Hint-K algorithms and design a mathematical model that can efficiently describe the activeness of any block in any cache level. Simulation results show that Hint-K achieves better performance compared to the existing popular multilevel cache schemes such as PROMOTE, DEMOTE, and MQ under different I/O workloads.
机译：I / O性能对于大规模分布式系统至关重要。已经提出了许多方法，包括基于提示的多级缓存，以消除不同级别之间的差距。这些解决方案基于最新的历史信息降级或提升缓存块，这对于频繁降级和提升操作的应用程序是不够的。在本文中，我们提出了一种使用K-step提示（Hint-K）的新颖的多级缓冲区高速缓存，以提高分布式系统的I / O性能。基本思想是基于块的先前K步升级或降级操作（称为K步提示），将一个块从较低级别的缓存提升到较高的级别，或反之则将其降级。如果我们在Hint-K和LRU-K之间进行类比，那么LRU-K会跟踪单个缓存级别中块的最后K个引用的时间，而我们的Hint-K会跟踪最近K个运动的信息（降级或升级）不同缓存级别之间的块。我们开发了Hint-K算法并设计了一个数学模型，可以有效地描述任何高速缓存级别中任何块的活动性。仿真结果表明，与现有的流行的多级缓存方案（例如PROMOTE，DEMOTE和MQ）在不同的I / O工作负载下相比，Hint-K的性能更高。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号