• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Operating systems review >A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching
【24h】

A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching

机译：跟踪驱动的并行预取和缓存算法比较

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

摘要

High-performance I/O systems depend on prefetching and caching in order to deliver good performance to applications. These two techniques have generally been considered in isolation, even though there are significant interactions between them; a block prefetched too early reduces the effectiveness of the cache, while a block cached too long reduces the effectiveness of prefetching. In this paper we study the effects of several combined prefetching and caching strategies for systems with multiple disks. Using disk-accurate trace-driven simulation, we explore the performance characteristics of each of the algorithms in cases in which applications provide full advance knowledge of accesses using hints. Some of the strategies have been published with theoretical performance bounds, and some are components of systems that have been built. One is a new algorithm that combines the desirable characteristics of the others. We find that when performance is limited by I/O stalls, aggressive prefetching helps to alleviate the problem; that more conservative prefetching is appropriate when significant I/O stalls are not present; and that a single, simple strategy is capable of doing both.
机译：高性能I / O系统依赖于预取和缓存，以便为应用程序提供良好的性能。尽管这两种技术之间存在重大的相互作用，但通常都将其单独考虑。太早预取的块会降低缓存的有效性，而太长的块则会降低预取的有效性。在本文中，我们研究了几种组合的预取和缓存策略对具有多个磁盘的系统的影响。使用磁盘精确的跟踪驱动模拟，在应用程序使用提示提供访问的完整高级知识的情况下，我们探索了每种算法的性能特征。已经发布了一些具有理论性能界限的策略，而另一些则是已构建系统的组件。一种是结合了其他算法的理想特性的新算法。我们发现，当性能受到I / O停顿的限制时，积极的预取有助于缓解该问题。当不存在大量I / O停顿时，更保守的预取是适当的；而且一个简单的策略既可以做到又可以做到。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号