Dmitry Vyukov — Go scheduler: Implementing language with lightweight concurrency
Channel:Hydra · Length:1:00:39 · Published:2019-10-14 · Views:47037
Summary
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 HN recommends it
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, 2026
C, C++, Rust, Go & systems languages · Software performance & optimization · Compilers, interpreters & program analysis
Subtitles (excerpt)
hello my name is nithya view cough I work a software engineer at Google and today I will try to not you let fall asleep after the lunch by presenting the talk go scheduler implementing language was lightweight concurrency so I will talk about how to build a scheduler how to make it efficient and scalable and then I will talk about fairness stacks and preemption so this is about the go language go language has built-in support for concurrency and the main primitive for concurrency is called a goroutine logically goroutine is a thread of execution so logically it's the same as operating system threat and equality in our green fret and most material in this presentation is somewhat generic and a large degree applicable to operating system schedulers co-routine schedulers other languages hopefully if you find it interesting and useful even if you don't have specific interests in the go language but there are some go specifics first of all I am going to talk about what is currently implemented in the go language not about something else and the second go language imposes on us some requirements and constraints and we make our design decisions based on those requirements so if you will have some different
On Hacker News
[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. — c0balt, 2026-03
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] — RossBencina, 2020-02
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] — lukaslalinsky, 2025-10
Related videos
- Brian Beckman: Don't fear the Monad · jasonofthel33t · 1:07:10
- How Python was Shaped by leaky Internals, Armin Ronacher, Flask framework · Видео с мероприятий {speach! · 49:55
- Rich Harris - Rethinking reactivity · You Gotta Love Frontend · 36:45
- CppCon 2015: Andrei Alexandrescu “std::allocator...” · CppCon · 1:12:27
- Lexical Scanning in Go - Rob Pike · GoogleFOSSSydney · 51:17
- William Byrd on "The Most Beautiful Program Ever Written" [PWL NYC] · PapersWeLove · 1:31:05
- Preventing the Collapse of Civilization / Jonathan Blow (Thekla, Inc) · DevGAMM · 1:02:41
- "Performance Matters" by Emery Berger · Strange Loop Conference · 42:15
- The Thirty Million Line Problem · Molly Rocket · 1:48:55
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step” · CppCon · 59:33
- RustConf 2018 - Closing Keynote - Using Rust For Game Development by Catherine West · Rust Programming Language · 42:29
- Erlang Factory 2014 - That's 'Billion' with a 'B': Scaling to the Next Level at WhatsApp · Erlang Solutions · 49:15
- How Crash Bandicoot Hacked The Original Playstation | War Stories | Ars Technica · Ars Technica · 31:37
- "How NOT to Measure Latency" by Gil Tene · Strange Loop Conference · 42:59
- CppCon 2016: Jason Turner “Rich Code for Tiny Computers: A Simple Commodore 64 Game in C++17” · CppCon · 1:19:52
- Clasp: Common Lisp using LLVM and C++ for Molecular Metaprogramming · Google TechTalks · 57:37