首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >PSCR: a coherence protocol for eliminating passive sharing in shared-bus shared-memory multiprocessors
【24h】

PSCR: a coherence protocol for eliminating passive sharing in shared-bus shared-memory multiprocessors

机译:PSCR:一种一致性协议,用于消除共享总线共享内存多处理器中的被动共享

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

摘要

In high-performance general-purpose workstations and servers, the workload can be typically constituted of both sequential and parallel applications. Shared-bus shared-memory multiprocessor can be used to speed-up the execution of such workload. In this environment, the scheduler takes care of the load balancing by allocating a ready process on the first available processor, thus producing process migration. Process migration and the persistence of private data into different caches produce an undesired sharing, named passive sharing. The copies due to passive sharing produce useless coherence traffic on the bus and coping with such a problem may represent a challenging design problem for these machines. Many protocols use smart solutions to limit the overhead to maintain coherence among shared copies. None of these studies treats passive-sharing directly, although some indirect effect is present while dealing with the other kinds of sharing. Affinity scheduling can alleviate this problem, but this technique does not adapt to all load conditions, especially when the effects of migration are massive. We present a simple coherence protocol that eliminates passive sharing using information from the compiler that is normally available in operating system kernels. We evaluate the performance of this protocol and compare it against other solutions proposed in the literature by means of enhanced trace-driven simulation. We evaluate the complexity in terms of the number of protocol states, additional bus lines, and required software support. Our protocol further limits the coherence-maintaining overhead by using information about access patterns to shared data exhibited in parallel applications.
机译:在高性能的通用工作站和服务器中,工作负载通常可以由顺序和并行应用程序组成。共享总线共享内存多处理器可用于加速此类工作负载的执行。在这种环境中,调度程序通过在第一个可用处理器上分配就绪的进程来照顾负载平衡,从而产生进程迁移。进程迁移和私有数据在不同缓存中的持久性会产生不希望的共享,称为被动共享。由于被动共享而导致的副本会在总线上产生无用的一致性流量,因此应对此类问题可能是这些机器面临的挑战性设计问题。许多协议使用智能解决方案来限制开销,以维护共享副本之间的一致性。尽管在处理其他类型的共享时存在一些间接影响,但这些研究都没有直接处理被动共享。相似性调度可以缓解此问题,但是此技术不能适应所有负载条件,尤其是在迁移的影响很大时。我们提出了一种简单的一致性协议,该协议使用来自操作系统内核中通常可用的来自编译器的信息来消除被动共享。我们评估了该协议的性能,并通过增强的跟踪驱动仿真将其与文献中提出的其他解决方案进行了比较。我们根据协议状态数量,附加总线线路和所需的软件支持来评估复杂性。我们的协议通过使用有关对并行应用程序中展示的共享数据的访问模式的信息,进一步限制了保持一致性的开销。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号