47K views · Oct 14, 2019 · 1:00:40 · 2 HN recommenders · 3 mentions · discussed 2020–2026
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.
Why Hacker News points people here: 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.
“This one notably also explains the design considerations for golangs M:N:P in comparison to other schemes”HN comment, 2026
“This is a good watch”
Talk on Go scheduler and lightweight concurrency
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) this video
“This one notably also explains the design considerations for golangs M:N:P in comparison to other schemes”
Explains design considerations behind Go's M:N:P scheduler versus other schemes
this 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.
“but they have nasty performance side-effects, see”
Explains performance problems of segmented stacks in Go
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 this video
