首页> 外文期刊>Computer Architecture Letters >SMT-Directory: Efficient Load-Load Ordering for SMT
【24h】

SMT-Directory: Efficient Load-Load Ordering for SMT

机译:SMT目录:SMT的有效负载排序

获取原文
获取原文并翻译 | 示例

摘要

Memory models like SC, TSO, and PC enforce load-load ordering, requiring that loads from any thread appear to occur in program order to all other threads. Out-of-order execution can violate load-load ordering. Multi-processors with out-of-order cores detect load-load ordering violations by snooping an age-ordered load queue on cache invalidations or evictions---events that act as proxies for the completion of remote stores. This mechanism becomes less efficient in an SMT, as every completing store must search the loads queue segments of all other threads. This inefficiency exists because store completions from other threads in the same core are not filtered by the cache: thread 0 observes all of thread 1's stores, not only the first store to every cache line. SMT-Directory eliminates this overhead by implementing the filtering traditionally provided by the cache in the cache itself. SMT-Directory adds a per-thread ``read'' bit to every cache line. When a load executes, it sets the bit corresponding to its thread. When a store completes, it checks the SMT-Directory bits of its cache line and searches the load queue segments only of those threads whose bits are set. As a result, local store completions trigger searches only for data that is actually shared.
机译:诸如SC,TSO和PC之类的内存模型会强制执行负载-负载排序,要求任何线程的负载似乎都按照程序顺序出现在所有其他线程上。乱序执行可能会违反负载-负载排序。具有乱序内核的多处理器通过侦听缓存失效或逐出的按时间排序的加载队列来检测负载-负载排序违规行为,这些事件充当完成远程存储的代理。由于每个完成存储都必须搜索所有其他线程的装入队列段,因此该机制在SMT中的效率降低。之所以存在这种低效率,是因为高速缓存不过滤来自同一核心中其他线程的存储完成:线程0观察线程1的所有存储,而不仅是每个高速缓存行的第一个存储。 SMT目录通过在缓存本身中实现传统上由缓存提供的过滤来消除这种开销。 SMT目录向每个高速缓存行添加了每个线程的``读取''位。执行加载时,它将设置与其线程相对应的位。存储完成后,它将检查其高速缓存行的SMT-Directory位,并仅搜索那些设置了位的线程的装入队列段。结果,本地存储完成操作仅触发搜索实际共享的数据。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号