high performance computing on graphics processing units: hgpu.org

hgpu.org » Memory

Complexity effective memory access scheduling for many-core accelerator architectures

George L. Yuan, Ali Bakhoda, Tor M. Aamodt

View

Tags: Architecture, Computer science, CUDA, Hardware, Memory, nVidia

November 28, 2010 by hgpu

CLUEstering: a high-performance density-based clustering library for scientific computing

CLUEstering: a high-performance density-based clustering library for scientific computing

PyOMP: OpenMP for Python in Numba

PyOMP: Parallel programming for CPUs and GPUs with OpenMP and Python

HiRep

Scaling SU(2) to 1000 GPUs using HiRep

GPPerf: Energy-Aware GPU Performance Prediction and Optimization Framework

Understanding GEMM Performance and Energy on NVIDIA Ada Lovelace: A Machine Learning-Based Analytical Approach

gpuPairHMM: Ultra-fast GPU-based PairHMM for DNA Variant Calling

gpuPairHMM: High-speed Pair-HMM Forward Algorithm for DNA Variant Calling on GPUs

Gaia AVU-GSR

Performance portability via C++ PSTL, SYCL, OpenMP, and HIP: the Gaia AVU-GSR case study

Kokkidio: Kokkos+Eigen - write fast, readable multi-platform code

Kokkidio: Fast, expressive, portable code, based on Kokkos and Eigen

LLaMA-Inference-Bench

LLM-Inference-Bench: Inference Benchmarking of Large Language Models on AI Accelerators

MATAR

On a Simplified Approach to Achieve Parallel Performance and Portability Across CPU and GPU Architectures

Over-synchronization in GPU Programs

Over-synchronization in GPU Programs

See all packages

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Login | Sitemap | Feedback | Policy

Contact us: