BBuf/how-to-optim-algorithm-in-cuda

how to optimize some algorithm in cuda.

View on GitHub ↗Jump to charts ↓

BBuf/how-to-optim-algorithm-in-cuda has 3k+ stars and 250+ forks on GitHub, is written in Cuda, and was last pushed on Oct 11, 2026. Data as of . Signed-in members get hourly updates — create a free account.

Summary Information

Updated 30 minutes ago
Added to GitGenius on September 21st, 2026
Created on July 18th, 2018
Open Issues & Pull Requests: 8 (+0)
GitHub issues: Enabled
Number of forks: 297
Total Stargazers: 3,318 (+0)
Total Subscribers: 35 (+0)

Repository Insights (GitGenius)

Median issue/PR response: 0.0 hours
Mean response time: 12.6 days
90th percentile: 63.1 days
Tracked items: 5

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 4
New in 7 days: 0
Closed in 7 days: 0
Avg open age: 233 days
Stale 30+ days: 3
Stale 90+ days: 3

Recent activity

Opened in 7 days: 0
Closed in 7 days: 0
Comments in 7 days: 0
Events in 7 days: 0

Top labels

No label distribution available yet.

Most active issues this week

Sign in to see which issues are moving.
Sign in

Detailed Description

how-to-optim-algorithm-in-cuda is a study and reference collection for CUDA kernel optimization and GPU systems work.

The repository addresses the challenge of learning practical GPU optimization by gathering hands-on examples, implementation notes, and architectural insights across multiple layers of the GPU stack. It covers concrete kernel implementations for common operations like reduction and softmax, explores high-level optimization frameworks such as CUTLASS and Triton, documents low-level instruction set details through PTX ISA notes, and synthesizes optimization patterns specific to LLM inference and training workloads.

This material suits developers working on GPU-accelerated systems who want to understand optimization from first principles rather than relying solely on library abstractions. It is particularly valuable for those building or tuning inference serving systems, implementing custom kernels, or diving into PyTorch internals on the GPU side. The collection spans from handwritten CUDA kernels through DSL-based approaches like Triton and CuTe, allowing someone to choose an appropriate abstraction level for their problem. The repository explicitly includes LLM-specific optimization notes, making it relevant for anyone working on large language model deployment or training infrastructure.

The project maintains active curation focused on CUDA kernels, LLM inference optimization, and AI infrastructure work. Older material is being consolidated or replaced with English-language entry points, indicating ongoing effort to keep content current and accessible. The repository functions as a public engineering notebook rather than a polished library, with content organized by topic across directories covering kernel implementations, lecture notes, framework-specific material, and architectural papers.