Graphics Processing Unit Accelerated Hirsch-Fye Quantum Monte Carlo

ORAL

Abstract

In Dynamical Mean Field Theory and its cluster extensions, such as the Dynamic Cluster Algorithm, the bottleneck of the algorithm is solving the self-consistency equations with an impurity solver. Hirsch-Fye Quantum Monte Carlo is one of the most commonly used impurity and cluster solvers. This work implements optimizations of the algorithm, such as enabling large data re-use, suitable for the Graphics Processing Unit (GPU) architecture. The GPU's sheer number of concurrent parallel computations and large bandwidth to many shared memories takes advantage of the inherent parallelism in the Green function update and measurement routines, and can substantially improve the efficiency of the Hirsch-Fye impurity solver.

Authors

  • Conrad Moore

    • Louisiana State University
  • Sameer Abu Asal

    • Louisiana State University
  • Kaushik Rajagoplan

    • Louisiana State University
  • David Poliakoff

    • Louisiana State University
  • Joseph Caprino

    • Louisiana State University
  • Karen Tomko

    • Ohio State University
  • Bhupender Thakur

    • Louisiana State University
  • Shuxiang Yang

    • Louisiana State University
  • Juana Moreno

    • Louisiana State University
  • Mark Jarrell

    • Louisiana State University