2026-07-25T03:04:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23589 2025-10-27T10:21:49Z ddc:004 open_access

Bounding the WCET of a GPU Thread Block with a Multi-Phase Representation of Warps Execution Jeanmougin, Louison Carle, Thomas Rochange, Christine GPU WCET analysis This paper proposes to model the Worst-Case Execution Time (WCET) of a GPU thread block as the Worst-Case Response Time (WCRT) of the warps composing the block. Inspired by the WCRT analyzes for classical CPU tasks, the response time of a warp is modeled as its execution time in isolation added to an interference term that accounts for the execution of higher priority warps. We provide an algorithm to build a representation of the execution of each warp of a thread block that distinguishes phases of execution on the functional units and phases of idleness due to operations latency. A simple formula relying on this model is then proposed to safely upper bound the WCRT of warps scheduled under greedy policies such as Greedy-Then-Oldest (GTO) or Loose Round-Robin (LRR). We experimented our approach using simulations of kernels from a GPU benchmark suite on the Accel-Sim simulator. We also evaluated the model on a GPU program that is likely to be found in safety critical systems : SGEMM (Single-precision GEneral Matrix Multiplication). This work constitutes a promising first building block of an analysis pipeline for enabling static WCET computation on GPUs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Louison Jeanmougin and Thomas Carle and Christine Rochange 2025 Is Part Of LIPIcs, Volume 335, 37th Euromicro Conference on Real-Time Systems (ECRTS 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2025.11 urn:nbn:de:0030-drops-235898 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2025.11 eng https://creativecommons.org/licenses/by/4.0/legalcode