• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International conference on supercomputing >A Study of Three Dynamic Approaches to Handle Widely Shared Data In Shared-Memory Multiprocessors
【24h】

A Study of Three Dynamic Approaches to Handle Widely Shared Data In Shared-Memory Multiprocessors

机译：三种动态方法在共享内存多处理器中处理广泛共享数据的动态方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper we argue that widely shared data are a more serious problem than previously recognized, and that furthermore, it is possible to provide transparent support that actually gives an advantage to accesses to widely snared data by exploiting their redundancy to improve accessibility. The GLOW extensions to cache coherence protocols -previously proposed- provide such support for widely shared data by defining functionality in the network domain. However, in their static form the GLOW extensions relied on the user to identify and expose widely shared data to the hardware. This approach suffers because: i) it requires modification of the programs, ii) it is not always possible to statically identify the widely shared data, and iii) it is incompatible with commodity hardware. To address these issues, we study three dynamic schemes to discover widely shared data at runtime. The first scheme is inspired by read-combining and is based on observing requests in the network switches - the GLOW agents. The agents intercept requests whose addresses have been observed recently. This scheme tracks closely the performance of the static GLOW while it always outperforms ordinary congestion-based read-combining. In the second scheme, the memory directory discovers widely shared data by counting the number of reads between writes. Information about the widely shared nature of data is distributed to the nodes which subsequently use special wide sharing requests to access them. Simulations confirm that this scheme works well when the widely shared nature of the data is persistent over time. The third and most significant scheme is based on predicting which load instructions are going to access widely shared data. Although the implementation of this scheme is not as straightforward in a commodity-parts environment, it outperforms all others.
机译：在本文中，我们认为广泛共享的数据是比以前认识到的更严重的问题，并且此外，可以通过利用它们冗余来提高可访问性来提供透明支持，实际上可以通过利用它们来访问广泛捕获的数据。高速缓存同时协议的发光扩展 - 普遍建议 - 通过在网络域中定义功能来为广泛共享数据提供此类支持。然而，在它们的静态形式中，用户依赖于用户依赖的发光扩展，以识别和将广泛共享的数据识别到硬件。这种方法是因为：i）需要修改程序，ii）并不总是可以静态识别广泛共享的数据，并且III）与商品硬件不兼容。为了解决这些问题，我们研究了三种动态方案，以在运行时发现广泛的共享数据。第一种方案是通过读合组合的启发，并基于网络交换机中的观察请求 - 发光剂。代理拦截最近已经观察到的地址的请求。该方案仔细追踪静态发光的性能，而始终优于普通拥堵的读合组合。在第二个方案中，存储器目录通过计算写入之间的读数的数量来发现广泛共享的数据。有关数据广泛共享性质的信息分布到随后使用特殊广播共享请求访问它们的节点。仿真确认，当数据的广泛共享性质随着时间的推移持续存在时，该方案很好。第三个和最重要的方案是基于预测哪些加载指令将访问广泛共享的数据。虽然该方案的实施在商品零件环境中并不是直接的，但它优于所有其他方面。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号