HackerTube

Dmitry Vyukov — Go scheduler: Implementing language with lightweight concurrency

Hydra2 HN recommenders · 2020–2026
47K views · talk · evergreen · Uploaded 2019-10-14

Go runtime contributor Dmitry Vyukov looks inside the Go scheduler, explaining how goroutines and channels are implemented. He covers the main scheduler components and overall operation, then goes into details such as preemption and stacks.

Recommended as a good watch on how Go's M:N:P scheduler works and why it was designed that way compared with alternative schemes.

C, C++, Rust, Go & systems languagesCompilers, interpreters & program analysisSoftware performance & optimization

Watch on YouTube

3 comments from Hacker News

@RossBencina2020 · in “A Hitchhiker’s Guide to Asynchronous Programming”

I guess that's because they are "intros," and often multi-core event loops are implemented by the language runtime or some threadpool library. This is a good watch: Dmitry Vyukov — Go scheduler: Implementing language with lightweight concurrency (Oct 14, 2019) [VIDEO]

RecommendsView on HN
@lukaslalinsky2025 · in “How I turned Zig into my favorite language to write network programs in”

Go depends on the fact that it can track all pointers, and when it needs to resize stacks, it can update them. Previous versions of Go used segmented stacks, which are theoretically possible, if Zig really wanted (would need compiler support), but they have nasty performance side-effects, see [VIDEO]

CitesView on HN
@c0balt2026 · in “Understanding the Go Runtime: The Scheduler”

[VIDEO] - Dmitry Vyukov — Go scheduler: Implementing language with lightweight concurrency This one notably also explains the design considerations for golangs M:N:P in comparison to other schemes and which specific challenges it tries to address.

RecommendsView on HN