mlsanityData to 14 Oct 2026

GCL-Sampler: Discovering Kernel Similarity for Sampled GPU Simulation via Graph Contrastive Learning

arXiv 2603.00551 ↗First posted 28 Feb 2026cs.PF cs.AR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

GPU architectural simulation is orders of magnitude slower than native execution, necessitating workload sampling for practical speedups. Existing methods rely on hand-crafted features with limited expressiveness, yielding either aggressive sampling with high errors or conservative sampling with constrained speedups. To address these issues, we propose GCL-Sampler, a sampling framework that leverages Relational Graph Convolutional Networks with contrastive learning to automatically discover high-dimensional kernel similarities from trace graphs. By encoding instruction sequences and data dependencies into graph embeddings, GCL-Sampler captures rich structural and semantic properties of program execution, enabling both high fidelity and substantial speedup. Evaluations on extensive benchmarks show that GCL-Sampler achieves 258.94x average speedup against full workload with 0.37% error, outperforming state-of-the-art methods, PKA (129.23x, 20.90%), Sieve (94.90x, 4.10%) and STEM+ROOT (56.57x, 0.38%).

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 32 references that are in the map. First posted on arXiv 28 Feb 2026.

Builds on

5 of 32 references.

References · 5

  1. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  2. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  3. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
  4. 2017Hierarchical Clustering: Objective Functions and Algorithmscited by 60
  5. 2020A Simple Model for Portable and Fast Prediction of Execution Time and Power Consumption of GPU Kernelscited by 7

Built on by

Not cited yet.