• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Efficient and Scalable Starvation Prevention Mechanism for Token Coherence
【24h】

Efficient and Scalable Starvation Prevention Mechanism for Token Coherence

机译：高效，可扩展的饥饿预防机制，以实现令牌一致性

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

摘要

Token Coherence is a cache coherence protocol that simultaneously captures the best attributes of the traditional approximations to coherence: direct communication between processors (like snooping-based protocols) and no reliance on bus-like interconnects (like directory-based protocols). This is possible thanks to a class of unordered requests that usually succeed in resolving the cache misses. The problem of the unordered requests is that they can cause protocol races, which prevent some misses from being resolved. To eliminate races and ensure the completion of the unresolved misses, Token Coherence uses a starvation prevention mechanism named persistent requests. This mechanism is extremely inefficient and, besides, it endangers the scalability of Token Coherence since it requires storage structures (at each node) whose size grows proportionally to the system size. While multiprocessors continue including an increasingly number of nodes, both the performance and scalability of cache coherence protocols will continue to be key aspects. In this work, we propose an alternative starvation prevention mechanism, named priority requests, that outperforms the persistent request one. This mechanism is able to reduce the application runtime more than 20 percent (on average) in a 64-processor system. Furthermore, thanks to the flexibility shown by priority requests, it is possible to drastically minimize its storage requirements, thereby improving the whole scalability of Token Coherence. Although this is achieved at the expense of a slight performance degradation, priority requests still outperform persistent requests significantly.
机译：令牌一致性是一种缓存一致性协议，它同时捕获了传统一致性的最佳属性：处理器之间的直接通信（如基于侦听的协议），而不依赖于总线式互连（如基于目录的协议）。这归功于一类无序的请求，这些请求通常可以成功解决缓存丢失问题。无序请求的问题在于它们可能导致协议争用，从而阻止解决某些未命中问题。为了消除种族并确保未解决的未命中事件的完成，令牌一致性使用了名为持久性请求的饥饿预防机制。这种机制效率极低，而且，由于它需要存储结构（在每个节点上），其大小与系统大小成比例增长，因此，它危及令牌一致性的可伸缩性。尽管多处理器继续包括越来越多的节点，但是高速缓存一致性协议的性能和可伸缩性将继续是关键方面。在这项工作中，我们提出了另一种防止饥饿的机制，称为优先级请求，该机制优于持久性请求。在64个处理器的系统中，该机制可以将应用程序运行时间减少20％以上（平均）。此外，由于优先级请求显示的灵活性，可以极大地减少其存储需求，从而提高令牌一致性的整体可伸缩性。尽管这是以稍微降低性能为代价来实现的，但是优先级请求仍然明显优于持久性请求。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号