• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Operating systems review >Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems
【24h】

Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems

机译：共享虚拟内存系统的两种基于家庭的惰性释放一致性协议的性能评估

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

摘要

This paper investigates the performance of shared virtual memory protocols on large-scale multicomputers. Using experiments on a 64-node Paragon, we show that the traditional Lazy Release Consistency (LRC) protocol does not scale well, because of the large number of messages it requires, the large amount of memory it consumes for protocol overhead data, and because of the difficulty of garbage collecting that data. To achieve more scalable performance, we introduce and evaluate two new protocols. The first, Home-based LRC (HLRC), is based on the Automatic Update Release Consistency (AURC) protocol. Like AURC, HLRC maintains a home for each page to which all updates are propagated and from which all copies are derived. Unlike AURC, HLRC requires no specialized hardware support. We find that the use of homes provides substantial improvements in performance and scalability over LRC. Our second protocol, called Overlapped Home-based LRC (OHLRC), takes advantage of the communication processor found on each node of the Paragon to offload some of the protocol overhead of HLRC from the critical path followed by the compute processor. We find that OHLRC provides modest improvements over HLRC. We also apply overlapping to the base LRC protocol, with similar results. Our experiments were done using five of the Splash-2 achmarks. We report overall execution times, as well as detailed breakdowns of elapsed time, message traffic, and memory use for each of the protocols.
机译：本文研究了共享虚拟内存协议在大型多计算机上的性能。通过在64节点的Paragon上进行的实验，我们发现传统的延迟释放一致性（LRC）协议无法很好地扩展，因为它需要大量消息，协议开销数据会消耗大量内存，并且垃圾收集该数据的难度。为了获得更高的可扩展性能，我们引入并评估了两个新协议。第一个基于家庭的LRC（HLRC）基于自动更新发布一致性（AURC）协议。像AURC一样，HLRC为每个页面维护一个主页，所有更新都将传播到该主页，并从中导出所有副本。与AURC不同，HLRC不需要专门的硬件支持。我们发现，与LRC相比，房屋的使用在性能和可伸缩性方面提供了实质性的改进。我们的第二个协议称为“基于重叠家庭的LRC（OHLRC）”，它利用在Paragon的每个节点上找到的通信处理器将HLRC的某些协议开销从计算处理器所遵循的关键路径上卸载。我们发现OHLRC与HLRC相比提供了适度的改进。我们还将重叠应用于基本LRC协议，结果相似。我们的实验是使用五个Splash-2标记完成的。我们报告总体执行时间，以及每个协议的经过时间，消息流量和内存使用情况的详细细分。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号