high performance computing on graphics processing units: hgpu.org

hgpu.org » nVidia GeForce GTX 1070 Ti

Simple Iterative Incompressible Smoothed Particle Hydrodynamics

Abhinav Muta, Prabhu Ramachandran, Pawan Negi

View

Tags: Benchmarking, Computational Physics, Fluid dynamics, Laplace and Poisson equation, nVidia, nVidia GeForce GTX 1050 Ti, nVidia GeForce GTX 1070 Ti, OpenCL, Package, Poisson equation

August 11, 2019 by hgpu

torchPDLP: Primal-Dual Linear Programming in PyTorch. In collaboration with AMD and IPAM

Accelerating a Linear Programming Algorithm on AMD GPUs

Benchmarks for Dissecting CPU-GPU Unified Physical Memory on AMD MI300A APUs

Dissecting CPU-GPU Unified Physical Memory on AMD MI300A APUs

kvcached: Elastic KV cache for dynamic GPU sharing and efficient multi-LLM inference

Towards Efficient and Practical GPU Multitasking in the Era of LLM

Bandicoot: C++ library for GPU accelerated linear algebra

Bandicoot: A Templated C++ Library for GPU Linear Algebra

Luthier: Bridging Auto-Tuning and Vendor Libraries for Efficient Deep Learning Inference

Luthier: Bridging Auto-Tuning and Vendor Libraries for Efficient Deep Learning Inference

Fused Kernel Library (FKL)

The Fused Kernel Library: A C++ API to Develop Highly-Efficient GPU Libraries

GPUHammer: Rowhammer Attacks on GPU Memories are Practical

GPUHammer: Rowhammer Attacks on GPU Memories are Practical

Block: Balance Loader of LLM Serving with Context, Knowledge and Predictive Scheduling

Block: Balancing Load in LLM Serving with Context, Knowledge and Predictive Scheduling

SIGMo: Scalable Isomorphism Graph Matching on GPUs

SIGMo: High-Throughput Batched Subgraph Isomorphism on GPUs for Molecular Matching

DGEMM without FP64 Arithmetic - using FP64 Emulation and FP8 Tensor Cores with Ozaki Scheme

DGEMM without FP64 Arithmetic – using FP64 Emulation and FP8 Tensor Cores with Ozaki Scheme

See all packages

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Login | Sitemap | Feedback | Policy

Contact us: