
0:00
18:21
Running one token through a language model isn't one big GPU operation. It's hundreds to thousands of tiny ones, and each of those has to be launched by the CPU first. During decode, those little operations finish so fast the GPU starves waiting for the CPU to queue the next one. CUDA Graphs fix this by recording the whole repeating sequence once and replaying it with a single launch, so the GPU stays fed. Same math, same result, far less idle time.
D'autres épisodes de "Code With Wilson"



Ne ratez aucun épisode de “Code With Wilson” et abonnez-vous gratuitement à ce podcast dans l'application GetPodcast.








