Concurrency trong Go: Tổng quan cơ chế hoạt động

Summary

The video introduces concurrency in Go and explains the runtime components that schedule goroutines.

Concurrency means handling multiple tasks during the same period. A system may switch rapidly between tasks, creating the impression that they are happening simultaneously, even when execution takes turns.

Goroutines are Go’s lightweight units of execution. The video compares them to smaller, more compact threads. They start with roughly 2 KB of memory, which can grow or shrink as needed.

When a Go program starts, its main function runs in a goroutine. The program can start additional goroutines to handle more work.

The Go runtime schedules goroutines using several related components:

• G (goroutine): The task to be run and its execution state.
• P (logical processor): Provides the scheduling resources needed to run goroutines.
• M (OS thread): The operating-system thread that executes a scheduled goroutine.
• Local run queue: Holds goroutines waiting for their turn to run.

At a given time, a goroutine is scheduled to run on an OS thread while other goroutines wait in a queue. The Go runtime decides which goroutine runs next and may return a goroutine to a queue so another can run.

This is a high-level introduction; the video notes that the runtime’s scheduling details will be covered further in later videos.

Speakers and Sources Featured

• Speaker: One narrator explaining Go concurrency.
• Technical systems discussed: Go runtime, goroutines, logical processors, OS threads, and CPU cores. No other speakers or guests are identifiable in the subtitles.