Personal sharing
Go’s empty struct occupies zero bytes thanks to a special zerobase address, and understanding this behavior reveals how to use empty structs for memory‑efficient patterns such as sets, signal channels, and struct alignment tricks.
This article explains Go's memory alignment concepts, why alignment is needed, demonstrates real-world layout differences with examples, discusses performance and portability impacts, and introduces tools like fieldalignment and structlayout to detect and fix alignment issues in Go programs.
Discover practical techniques to dramatically reduce the size of Go executables—starting with stripping debug symbols using ldflags, then applying UPX compression with optimal settings, and combining both methods to shrink a 6.5 MB binary down to around 1.4 MB, saving up to 80% space.
This article explains Go's reflect package, shows how reflection can simplify configuration loading, benchmarks the performance cost of reflection versus direct field access, and provides practical tips such as avoiding reflection in hot paths and using indexed field access with caching to dramatically improve speed.
This article explains the hedged request pattern used by Google to combat microservice tail latency, shows how to implement it in Go with context and goroutines, discusses its impact on latency and load, and explores additional techniques such as SingleFlight and service‑class prioritization to further reduce tail delays.
This article explores multiple in‑memory strategies—using a simple map with timers, per‑driver goroutine management, and especially a Go‑implemented timing wheel—to identify Uber drivers who haven’t reported for ten minutes, comparing their complexities, memory usage, and suitability for large‑scale systems.
The proposal introduces a ‘?’ operator to automatically handle errors in Go, aiming to reduce boilerplate while preserving explicitness, but it raises concerns about code readability, variable shadowing, and the effort required to update existing codebases.
An in‑depth look at Go’s origins, design goals, and the trade‑offs that provoke both admiration for its simplicity in large‑scale server development and criticism over its limited generics, file‑system API, error handling, and FFI capabilities.
Using a local Go server and Wireshark, the author measured that a basic HTTPS request transmits 2,164 bytes—about ten times more than an equivalent HTTP request—revealing the bandwidth impact of TLS handshakes and suggesting when HTTP may be preferable for internal, non‑sensitive traffic.
This article explains how Go 1.24 rewrote its built‑in map with a SwissTable‑based hash table, compares it to Dolt’s SwissMap implementation, and details the underlying data structures, algorithms, and performance benefits.
