• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'03) v.2; 20030623-20030626; Las Vegas,NV; US >Improving Cache Hit Rate through Cooperative Caching in Cluster-based Web Server
【24h】

Improving Cache Hit Rate through Cooperative Caching in Cluster-based Web Server

机译：通过基于群集的Web服务器中的协作缓存提高缓存命中率

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

摘要

Cluster systems provide not only a low cost but also a flexible alternative to fault-tolerant systems used for applications that require high-throughput and high-availability. Recently, research in cluster systems is concentrated on load balancing and caching policy in contents-based cluster. Cooperative caching has also been relied upon for achieving high-performance. In this paper, we propose a method which increases cache hit rate with hint-based cooperative caching in a web server cluster that provides high-availability, high-performance, and scalability. Our proposed method combines hint-based cooperative caching and DFR mechanism. The new mechanism uses access probability of each service based on the DFR(Duplicate Copy First Replacement) and the D-Hint in order to get higher cache hit rate. We have performed a trace-driven simulation for a cluster-based web server, and compared the method that uses service access probability with DFR. The simulation results show that our mechanism has less disk access rate.
机译：集群系统不仅提供了低成本，而且还可以灵活地替代用于需要高吞吐量和高可用性的应用程序的容错系统。最近，集群系统的研究集中于基于内容的集群中的负载平衡和缓存策略。还必须依靠协作缓存来实现高性能。在本文中，我们提出了一种在Web服务器群集中通过基于提示的协同缓存来提高缓存命中率的方法，该方法可提供高可用性，高性能和可伸缩性。我们提出的方法结合了基于提示的协同缓存和DFR机制。新机制使用基于DFR（重复复制优先替换）和D-Hint的每个服务的访问概率，以获得更高的缓存命中率。我们对基于群集的Web服务器执行了跟踪驱动的仿真，并将使用服务访问概率的方法与DFR进行了比较。仿真结果表明，我们的机制具有较低的磁盘访问率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号