• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of supercomputing >Are distributed sharing codes a solution to the scalability problem of coherence directories in manycores? An evaluation study
【24h】

Are distributed sharing codes a solution to the scalability problem of coherence directories in manycores? An evaluation study

机译：分布式共享代码是否可以解决多核中一致性目录的可伸缩性问题？评估研究

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

摘要

The development of efficient and scalable cache coherence protocols is a key aspect in the design of manycore chip multiprocessors. In this work, we present a comprehensive evaluation of a kind of cache coherence protocols that, despite having been already implemented during the 1990s for building large-scale commodity multiprocessors, have not been considered in the context of chip multiprocessors yet. In particular, we evaluate two directory-based cache coherence protocols based on the idea of having the sharing code of each memory block distributed between the different sharers (distributed sharing code). The first one employs simply-linked lists to encode the information about the sharers of the memory blocks, whilst the second one does the same using doubly-linked lists, which improves the management of replacements. We compare these two organizations with three protocols that use centralized sharing codes, each one having different directory memory overhead: one of them implementing a non-scalable bit-vector sharing code and the other two implementing more scalable limited-pointer schemes with one and two pointers, respectively. Simulation results show that for large-scale chip multiprocessors, the protocol based on distributed doubly-linked lists dramatically reduces the memory overhead of a non-scalable bit-vector directory, while at the same time it achieves its performance levels. This is achieved with just a small degradation on dynamic energy consumption (approximately 10% on average). This way, our results point out that for manycores, coherence directories based on distributed sharing codes are appealing alternatives to contemporary coherence directories based on centralized sharing codes.
机译：有效和可扩展的高速缓存一致性协议的开发是许多核心芯片多处理器设计的关键方面。在这项工作中，我们对一种缓存一致性协议进行了全面的评估，尽管该协议在1990年代就已经被用于构建大型商用多处理器，但尚未在芯片多处理器的背景下加以考虑。特别是，我们基于使每个存储块的共享代码分布在不同共享者之间的想法（分布式共享代码）来评估两种基于目录的缓存一致性协议。第一个使用简单链接列表对有关存储块共享者的信息进行编码，而第二个使用双向链接列表进行相同操作，从而改善了替换管理。我们将这两种组织与使用集中式共享代码的三种协议进行比较，每种协议具有不同的目录内存开销：其中一种实现了不可扩展的位向量共享代码，另外两种实现了具有一个和两个的更具扩展性的有限指针方案指针分别。仿真结果表明，对于大规模芯片多处理器，基于分布式双链表的协议显着减少了不可扩展位向量目录的内存开销，同时达到了性能水平。这仅通过动态能耗的小幅度下降即可实现（平均大约10％）。这样，我们的结果指出，对于许多核而言，基于分布式共享代码的一致性目录是基于集中式共享代码的现代一致性目录的有吸引力的替代方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号