2026-07-23T16:36:46Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18430 2024-03-06T10:32:11Z ddc:004 open_access

Warp-Level CFG Construction for GPU Kernel WCET Analysis Jeanmougin, Louison Sotin, Pascal Rochange, Christine Carle, Thomas Graphical Processing Unit (GPU) Control Flow Graphs (CFG) Worst-Case Execution Time (WCET) Program analysis We present an abstract interpretation technique to automatically build a Control Flow Graph (CFG) representation of the execution of a GPU kernel. GPUs implement an inherently parallel execution model, in which threads are grouped within so-called warps that execute in lockstep. This execution model enables the representation of the execution of the threads of a warp as a single CFG. However, thread divergence may appear within a warp and its effect must be captured explicitly within the CFG. Our method builds the CFG of a warp by applying abstract interpretation on the assembly (Nvidia SASS) code of a kernel, and by maintaining an abstract representation of which threads within the warp agree on which values. This allows the method to detect precisely the points in the program where thread divergence may occur, and avoid spurious reactivation edges in the CFG. We apply our technique on benchmark kernels as a proof-of-concept, and generate IPET systems using the resulting CFGs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Louison Jeanmougin and Pascal Sotin and Christine Rochange and Thomas Carle 2023 Is Part Of OASIcs, Volume 114, 21th International Workshop on Worst-Case Execution Time Analysis (WCET 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2023.1 urn:nbn:de:0030-drops-184303 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2023.1 eng https://creativecommons.org/licenses/by/4.0/legalcode