Go Garbage Collection: Tri-Color Mark & Sweep, Write Barriers & STW Optimization
The article discusses the evolution of garbage collection in the Go programming language, highlighting its transition from a stop-the-world approach to a concurrent model. It explains the tri-color mark and sweep algorithm introduced in Go 1.5, which allows garbage collection to occur without pausing the application. This improvement addresses latency issues and enhances performance in Go applications.
- ▪Go's garbage collection has evolved significantly since version 1.3.
- ▪The tri-color mark and sweep algorithm allows concurrent garbage collection, reducing application pauses.
- ▪The original mark and sweep method caused significant latency, which was unacceptable for web services.
Opening excerpt (first ~120 words) tap to expand
try { if(localStorage) { let currentUser = localStorage.getItem('current_user'); if (currentUser) { currentUser = JSON.parse(currentUser); if (currentUser.id === 2415836) { document.getElementById('article-show-container').classList.add('current-user-is-article-author'); } } } } catch (e) { console.error(e); } James Lee Posted on May 19 Go Garbage Collection: Tri-Color Mark & Sweep, Write Barriers & STW Optimization #algorithms #computerscience #go #performance Go Runtime Internals: Scheduler, Memory, GC & Performance (7 Part Series) 1 Go Performance Optimization: pprof, Flame Graphs & Hotspot Profiling 2 Go Heap Memory Allocation: tcmalloc, Mutator/Allocator & Multi-Level Cache ... 3 more parts...
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at DEV.to (Top).
Discussion
0 commentsMore from DEV.to (Top)
