LUMINA: LLM-Guided GPU Architecture Exploration via Bottleneck Analysis
Organizations: Microsoft Research China
Abstract
GPU design space exploration (DSE) for modern AI workloads, such as Large-Language Model (LLM) inference, is challenging because of GPUs' vast, multi-modal design spaces, high simulation costs, and complex design optimization objectives (e.g. performance, power and area trade-offs). Existing automated DSE methods are often prohibitively expensive, either requiring an excessive number of exploration samples or depending on intricate, manually crafted analyses of interdependent critical paths guided by human heuristics. We present LUMINA, an LLM-driven GPU architecture exploration framework that leverage AI to enhance the DSE efficiency and efficacy for GPUs. LUMINA extracts architectural knowledge from simulator code and performs sensitivity studies to automatically compose DSE rules,which are auto-corrected during exploration. A core component of LUMINA is a DSE Benchmark that comprehensively evaluates and enhances LLMs' capabilities across three fundamental skills required for architecture optimization, which provides a principled and reproducible basis for model selection and ensuring consistent architectural reasoning. In the design space with 4.7 million possible samples, LUMINA identifies 6 designs of better performance and area than an A100 GPU efficiently, using only 20 steps via LLM-assisted bottleneck analysis. In comparison, LUMINA achieves 17.5x higher than design space exploration efficiency, and 32.9% better designs (i.e. Pareto Hypervolume) than Machine-Learning baselines, showcasing its ability to deliver high-quality design guidance with minimal search cost.
Figures & tables
| Parameter | Value Range | # |
| Interconnect Link Count | 6, 12, 18, 24 | 4 |
| Core Count | 1, 2, 4, 8, 16, 32, 64, 96, 108, 128, 132, 136, 140, 256 | 14 |
| Sublane Count | 1, 2, 4, 8 | 4 |
| Systolic Array Height and Width | 4, 8, 16, 32, 64, 128 | 6 |
| Vector Width | 4, 8, 16, 32, 64, 128 | 6 |
| SRAM Size (KB) | 32, 64, 128, 192, 256, 512, 1024 | 7 |
| Category | Representative Method | Sample Learning | Sample Efficiency | Sample Scalibity |
|---|---|---|---|---|
| Heuristic | Grid Search ( Bergstra and Bengio, 2012 ) | No | Random | High |
| Random Walker ( Xia et al., 2020 ) | No | Random | High | |
| Machine Learning | Bayesian Optimization (BO) ( Li et al., 2025 ) | Yes | Low ( Krishnan et al., 2023 ) | Low ( Maddox et al., 2021 ) |
| Genetic Algorithms (GA) ( Kao and Krishna, 2020 ) | Yes | Low ( Krishnan et al., 2023 ) | Low ( Martínez-Ballesteros et al., 2015 ) | |
| Ant Colony Optimization (ACO) ( Gao and Schafer, 2021 ) | Yes | Low ( Krishnan et al., 2023 ) | Low ( Peake et al., 2019 ) | |
| Expertise-Driven | Bottleneck-Removal via Critical Path Analysis ( Bai et al., 2023 ) | No | High | Low |
| Benchmark Task | Model | Accuracy (Original) | Accuracy (Enhanced) |
|---|---|---|---|
| Bottleneck Analysis | Phi-4 | 0.70 | 0.76 |
| Qwen-3 | 0.73 | 0.80 | |
| Llama-3.1 | 0.47 | 0.53 | |
| Perf/Area Prediction | Phi-4 | 0.42 | 0.61 |
| Qwen-3 | 0.59 | 0.82 | |
| Llama-3.1 | 0.23 | 0.39 |
| Specifications | Design A | Design B | A100 |
| Interconnect Link Count | 24 | 18 | 12 |
| Core Count | 64 | 96 | 108 |
| Sublane Count | 4 | 4 | 4 |
| Vector Width | 16 | 16 | 32 |
| Systolic Array Height Weight | 32 32 | 32 32 | 16 16 |
| SRAM Size (KB) | 128 | 128 | 128 |
Automated Heuristic Design
Automated heuristic design creates or adapts problem-solving rules for optimization, planning, scheduling, and related search tasks.
See all 84 papers