【24h】

Multi-core Computation of Transfer Matrices for Strip Lattices in the Potts Model

机译:Potts模型中带状格子传递矩阵的多核计算

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

摘要

The transfer-matrix technique is a convenient way for studying strip lattices in the Potts model since the computational costs depend just on the periodic part of the lattice and not on the whole. However, even when the cost is reduced, the transfer-matrix technique is still an NP-hard problem since the time T (|V |, |E|) needed to compute the matrix grows exponentially as a function of the graph width. In this work, we present a parallel transfer-matrix implementation that scales performance under multi-core architectures. The construction of the matrix is based on several repetitions of the deletion-contraction technique, allowing parallelism suitable to multi-core machines. Our experimental results show that the multi-core implementation achieves speedups of 3.7X with p = 4 processors and 5.7X with p = 8. The efficiency of the implementation lies between 60% and 95%, achieving the best balance of speedup and efficiency at p = 4 processors for actual multi-core architectures. The algorithm also takes advantage of the lattice symmetry, making the transfer matrix computation to run up to 2X faster than its non-symmetric counterpart and use up to a quarter of the original space.
机译:转移矩阵技术是研究Potts模型中条形晶格的便捷方法,因为计算成本仅取决于晶格的周期性部分,而不取决于整体。但是,即使降低了成本,转移矩阵技术仍然是NP难题,因为计算矩阵所需的时间T(| V | | | E |)随图形宽度呈指数增长。在这项工作中,我们提出了一种并行的传输矩阵实现,可以在多核架构下扩展性能。矩阵的构建基于删除-收缩技术的多次重复,从而允许适用于多核计算机的并行性。我们的实验结果表明,多核实现在p = 4的处理器下可实现3.7倍的加速,在p = 8的情况下可达到5.7倍。该实现的效率在60%到95%之间,从而实现了加速和效率的最佳平衡。对于实际的多核体系结构,p = 4个处理器。该算法还利用了晶格对称性,使传输矩阵计算的运行速度比其非对称副本快2倍,并且占用了原始空间的四分之一。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号