Efficient multitasking of the Su(3) lattice gauge theory algorithm on the cray X-MP

Title of program: SU3 Catalogue Id: AABT_v1_0 Nature of problem The Monte Carlo lattice gauge theory algorithm with the metropolis et al. Updating procedure is vectorized and multitasked on the four processor CRAY X-MP and results in a code with a link-update-time, in 64-bit arithmetic and 10 hits-per-link, of 11.0 musec on a 16^4 lattice, the fastest link-update-time so far achieved. The program calculates the Wilson loops of size up to L/2 x L/2 for an L^4 lattice for SU(3) gauge theory. The formulation of a gauge theory on a lattice was proposed by Wils ... Versions of this program held in the CPC repository in Mendeley Data AABT_v1_0; SU3; 10.1016/0010-4655(85)90024-4 AABT_v2_0; SU3; 10.1016/0010-4655(93)90123-T This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)程序名称：SU3 目录编号：AABT_v1_0 问题特性 采用梅特罗波利斯（Metropolis）等人更新流程的蒙特卡洛（Monte Carlo）格点规范理论算法，在四处理器CRAY X-MP架构上实现了向量化与多任务并行优化。经测试，在64位浮点运算、每条链路10次命中的配置下，该代码在16^4格点上的链路更新耗时仅11.0微秒，为目前已公开的最快链路更新耗时。本程序针对SU(3)规范理论，可计算L^4格点体系下尺寸最大至L/2×L/2的威尔逊圈（Wilson loops）。格点规范理论的格点构建框架由Wilson等人提出（原文未完结）。 收录于Mendeley Data的CPC资料库中的本程序版本如下： AABT_v1_0; SU3; 10.1016/0010-4655(85)90024-4 AABT_v2_0; SU3; 10.1016/0010-4655(93)90123-T 本程序源自贝尔法斯特女王大学托管的CPC程序库（1969-2019）