Back to Research papers
Research paper index

Measuring and Reducing WebGPU Dispatch Overhead for LLM Inference

Jędrzej Maczan

arXiv:2608.08730Published August 9, 2026Updated August 11, 20260 citations
  • cs.LG
  • cs.DC
  • cs.PF

Abstract

Large Language Models are deployed to multiple types of environments, from internet browsers to edge devices, and WebGPU serves as a modern cross-platform standard. The engines for browser-based LLM inference have proliferated, yet the overhead of WebGPU per-operation dispatch remains poorly characterized. In this work, we introduce a sequential-dispatch measurement method and show that naive single-operation measurements overestimate per-dispatch cost by conflating dispatch with synchronization. Using our method, we measure the per-dispatch cost and show that it is independent of data type used. We show that the dispatch overhead, not kernel quality, is the bottleneck at batch size 1, and isolate the dispatch count as the cause. Therefore, we conclude that at batch size 1, the effective approach to LLM inference optimization in WebGPU is reducing dispatch count. Our findings point to dispatch amortization, in the inference engines and in the WebGPU specification, as a path to practical browser-based inference.

Read the original paper

This page indexes public paper metadata. The manuscript remains with its original publisher and authors.