Related papers: Three Dirac operators on two architectures with on…
We propose a discretisation scheme based on the Dirac-Kahler formalism (DK) in which the algebraic relations between continuum operators ${\wedge, d, \star}$ are captured by their discrete analogues, allowing the construction of the…
I study the leading effects of discretization errors on the low energy part of the spectrum of the Hermitian Wilson-Dirac operator in infinite volume. The method generalizes that used to study the spectrum of the Dirac operator in the…
The application of the Dirac operator on a spinor field, the Dslash operation, is the most computation-intensive part of the lattice QCD simulations. It is often the key kernel to optimize to achieve maximum performance on various…
There are existing standard solvers for tackling discrete optimization problems. However, in practice, it is uncommon to apply them directly to the large input space typical of this class of problems. Rather, the input is preprocessed to…
The overlap operator is a lattice discretization of the Dirac operator of quantum chromodynamics, the fundamental physical theory of the strong interaction between the quarks. As opposed to other discretizations it preserves the important…
Critical slowing down for the Krylov Dirac solver presents a major obstacle to further advances in lattice field theory as it approaches the continuum solution. We propose a new multi-grid approach for chiral fermions, applicable to both…
Performance optimization can be a daunting task especially as the hardware architecture becomes more and more complex. This paper takes a kernel from the Materials Science code BerkeleyGW, and demonstrates a few performance analysis and…
We show that using the multi-splitting algorithm as a preconditioner for the domain wall Dirac linear operator, arising in lattice QCD, effectively reduces the inter-node communication cost, at the expense of performing more on-node…
The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present an iterative method, first proposed by us in Ref. [1], which allows for an…
We compare the behavior of different lattice Dirac operators in gauge backgrounds which are lattice discretizations of a classical instanton. In particular we analyze the standard Wilson operator, a chirally improved Dirac operator and the…
As shown in earlier work, skew-adjoint linear differential operators, mapping efforts into flows, give rise to Dirac structures on a bounded spatial domain by a proper definition of boundary variables. In the present paper this is extended…
We develop an algebraic multigrid method for solving the non-Hermitian Wilson discretization of the 2-dimensional Dirac equation. The proposed approach uses a bootstrap setup algorithm based on a multigrid eigensolver. It computes test…
The efficient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for…
We discuss possible definitions of discrete Dirac operators, and discuss their continuum limits. It is well-known in the lattice field theory that the straightforward discretization of the Dirac operator introduces unwanted spectral…
An efficient $hp$-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We…
For successful deployment of deep neural networks on highly--resource-constrained devices (hearing aids, earbuds, wearables), we must simplify the types of operations and the memory/power resources used during inference. Completely avoiding…
We describe an efficient implementation of a recent simplex-type algorithm for the exact solution of separated continuous linear programs, and compare it with linear programming approximation of these problems obtained via discretization of…
Timing side-channel attacks pose a major threat to embedded systems due to their ease of accessibility. We propose CIDPro, a framework that relies on dynamic program diversification to mitigate timing side-channel leakage. The proposed…
Dynamic parallelism on GPUs allows GPU threads to dynamically launch other GPU threads. It is useful in applications with nested parallelism, particularly where the amount of nested parallelism is irregular and cannot be predicted…
A general local Fourier analysis for overlapping block smoothers on triangular grids is presented. This analysis is explained in a general form for its application to problems with different discretizations. This tool is demonstrated for…