Cover Image

Accelerating Lattice QCD Simulations using GPUs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Matthaei, Tilmann
Format:	Preprint
Published:	2024
Subjects:	High Energy Physics - Lattice Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Performance-Portable Optimization and Analysis of Multiple Right-Hand Sides in a Lattice QCD Solver
by: Long, Shiting, et al.
Published: (2026)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
by: Kreis, Lara, et al.
Published: (2026)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)

Eventually Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)

Constrained Cuts, Flows, and Lattice-Linearity
by: Streit, Robert, et al.
Published: (2025)

Parallel Scan on Ascend AI Accelerators
by: Wróblewski, Bartłomiej, et al.
Published: (2025)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)

DiaQ: Efficient State-Vector Quantum Simulation
by: Chundury, Srikar, et al.
Published: (2024)

Sorting in One and Two Rounds using $t$-Comparators
by: Gelles, Ran, et al.
Published: (2024)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)

BLEST: Blazingly Efficient BFS using Tensor Cores
by: Elbek, Deniz, et al.
Published: (2025)

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
by: Laukemann, Jan, et al.
Published: (2024)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
by: Liu, Quanquan C., et al.
Published: (2024)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
by: Prokopenko, Andrey, et al.
Published: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
by: Pourdamghani, Arash, et al.
Published: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)

Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
by: Akker, Erik van den, et al.
Published: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
by: Polyanskii, Nikita, et al.
Published: (2024)

Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
by: Ngo, Vinh Quang, et al.
Published: (2024)

Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Massively Parallel Ruling Set Made Deterministic
by: Giliberti, Jeff, et al.
Published: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
by: Almeida, Paulo Sérgio, et al.
Published: (2024)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
by: Sanders, Peter, et al.
Published: (2024)

Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
by: Gil, Yuval
Published: (2024)

Deterministic Expander Routing: Faster and More Versatile
by: Chang, Yi-Jun, et al.
Published: (2024)

Distributed Lovász Local Lemma under Bandwidth Limitations
by: Halldórsson, Magnús M., et al.
Published: (2024)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
by: Bai, Sirui, et al.
Published: (2024)

History Trees and Their Applications
by: Viglietta, Giovanni
Published: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
by: Latypov, Rustam, et al.
Published: (2024)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)

Distributed Download from an External Data Source in Faulty Majority Settings
by: Augustine, John, et al.
Published: (2024)