QIRAL: A High Level Language for Lattice QCD Code Generation

Abstract

Quantum chromodynamics (QCD) is the theory of subnuclear physics, aiming at mod- eling the strong nuclear force, which is responsible for the interactions of nuclear particles. Lattice QCD (LQCD) is the corresponding discrete formulation, widely used for simula- tions. The computational demand for the LQCD is tremendous. It has played a role in the history of supercomputers, and has also helped defining their future. Designing efficient LQCD codes that scale well on large (probably hybrid) supercomputers requires to express many levels of parallelism, and then to explore different algorithmic solutions. While al- gorithmic exploration is the key for efficient parallel codes, the process is hampered by the necessary coding effort. We present in this paper a domain-specific language, QIRAL, for a high level expression of parallel algorithms in LQCD. Parallelism is expressed through the mathematical struc- ture of the sparse matrices defining the problem. We show that from these expressions and from algorithmic and preconditioning formulations, a parallel code can be automatically generated. This separates algorithms and mathematical formulations for LQCD (that be- long to the field of physics) from the effective orchestration of parallelism, mainly related to compilation and optimization for parallel architectures.

ETAPS 2012, Tallin : Estonia (2012)

References in corpus (1)

• Solving Lattice QCD systems of equations using mixed precision solvers on GPUs

Cited by in corpus (20)

• A Gentle Introduction to Epistemic Planning: The DEL Approach
• Architecture aware compilation of quantum circuits via lazy synthesis
• Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
• Quantum Control Machine: The Limits of Control Flow in Quantum Programming
• Sheaves that fail to represent matrix rings
• Normalization for planar string diagrams and a quadratic equivalence algorithm
• Robustness of Equations Under Operational Extensions
• A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
• Combining First-Order Classical and Intuitionistic Logic
• A diagrammatic approach to symmetric lenses
• Scaling W state circuits in the qudit Clifford hierarchy
• Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
• Sampling Problems on a Quantum Computer
• Enriched Lawvere Theories for Operational Semantics
• Pearl's and Jeffrey's Update as Modes of Learning in Probabilistic Programming
• Asynchronous Functional Sessions: Cyclic and Concurrent
• Reasoning about Emergence of Collective Memory
• Programming Without Refining
• POPQC: Parallel Optimization for Quantum Circuits (Extended Version)
• The Optics of Language-Integrated Query