ترغب بنشر مسار تعليمي؟ اضغط هنا

Lattice QCD on upcoming Arm architectures

198   0   0.0 ( 0 )
 نشر من قبل Tilo Wettig
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Recently Arm introduced a new instruction set called Scalable Vector Extension (SVE), which supports vector lengths up to 2048 bits. While SVE hardware will not be generally available until about 2021, we believe that future SVE-based architectures will have great potential for Lattice QCD. In this contribution we discuss key aspects of SVE and describe how we implemented SVE in the Grid Lattice QCD framework.



قيم البحث

اقرأ أيضاً

104 - R. Babich , M. A. Clark , B. Joo 2011
Over the past five years, graphics processing units (GPUs) have had a transformational effect on numerical lattice quantum chromodynamics (LQCD) calculations in nuclear and particle physics. While GPUs have been applied with great success to the post -Monte Carlo analysis phase which accounts for a substantial fraction of the workload in a typical LQCD calculation, the initial Monte Carlo gauge field generation phase requires capability-level supercomputing, corresponding to O(100) GPUs or more. Such strong scaling has not been previously achieved. In this contribution, we demonstrate that using a multi-dimensional parallelization strategy and a domain-decomposed preconditioner allows us to scale into this regime. We present results for two popular discretizations of the Dirac operator, Wilson-clover and improved staggered, employing up to 256 GPUs on the Edge cluster at Lawrence Livermore National Laboratory.
We investigate implementation of lattice Quantum Chromodynamics (QCD) code on the Intel AVX-512 architecture. The most time consuming part of the numerical simulations of lattice QCD is a solver of linear equation for a large sparse matrix that repre sents the strong interaction among quarks. To establish widely applicable prescriptions, we examine rather general methods for the SIMD architecture of AVX-512, such as using intrinsics and manual prefetching, for the matrix multiplication. Based on experience on the Oakforest-PACS system, a large scale cluster composed of Intel Xeon Phi Knights Landing, we discuss the performance tuning exploiting AVX-512 and code design on the SIMD architecture and massively parallel machines. We observe that the same code runs efficiently on an Intel Xeon Skylake-SP machine.
185 - Adriano Di Giacomo 2010
The long standing problem is solved why the number and the location of monopoles observed in Lattice configurations depend on the choice of the gauge used to detect them, in contrast to the obvious requirement that monopoles, as physical objects, mus t have a gauge-invariant status. It is proved, by use of non-abelian Bianchi identities, that monopoles are indeed gauge-invariant: the technique used to detect them has instead an efficiency which depends on the choice of the abelian projection, in a known and controllable way.
We present updated results for $varepsilon_K$ determined directly from the standard model (SM) with lattice QCD inputs such as $hat{B}_K$, $|V_{cb}|$, $|V_{us}|$, $xi_0$, $xi_2$, $xi_text{LD}$, $f_K$, and $m_c$. We find that the standard model with e xclusive $|V_{cb}|$ and other lattice QCD inputs describes only 65% of the experimental value of $|varepsilon_K|$ and does not explain its remaining 35%, which leads to a strong tension in $|varepsilon_K|$ at the $4.6sigma sim 4.2sigma$ level between the SM theory and experiment. We also find that this tension disappears when we use the inclusive value of $|V_{cb}|$ obtained using the heavy quark expansion based on QCD sum rules.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا