【24h】

Dynamic Limited Directory Scheme using Data Locality

机译:使用数据局部性的动态受限目录方案

获取原文

摘要

The locality of data refernces affects the system performance significantly at the distributed shared memory systems. One methld to improve the performance is to use data allocation methods reflecting the locality of data references. This paper proposes a cache coherence scheme by utilizing the near processor locality, and evaluates its performance. The proposed scheme reduces memeory overhead by using a presence table and a directory pool. I f a processor is within a predefined distance, its identification is set to the presence table. Otherwise, its identification is stored to a directory pool. This scheme can solve the disadvantages of the limited directory scheme and the dynamic point allocation directory scheme. Three application programs, which have various shared data, are simulted to evaluate the performance of proposed scheme. The results show that the optimal data allocation method with the proposed scheme reduces the directory pool access up to 4.9 times.
机译:数据引用的局部性会严重影响分布式共享内存系统上的系统性能。一种提高性能的方法是使用反映数据引用位置的数据分配方法。本文提出了一种利用处理器附近位置的缓存一致性方案,并对其性能进行了评估。所提出的方案通过使用存在表和目录池来减少内存开销。如果处理器在预定义的距离内,则将其标识设置为状态表。否则,其标识将存储到目录池中。该方案可以解决受限目录方案和动态点分配目录方案的缺点。模拟了三个具有各种共享数据的应用程序,以评估所提出方案的性能。结果表明,采用该方案的最优数据分配方法可将目录池访问次数减少多达4.9次。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号