This article explains the fundamentals of Linux thread stack memory, identifies why default stack sizes can cause waste or overflow in high‑concurrency scenarios, and provides practical techniques—including stack‑size tuning, code refactoring, and memory‑mapping—to reduce memory usage and improve service stability.
This article explains the inner workings of Linux thread stacks, distinguishes user and kernel stacks, shows how NPTL creates independent stacks, highlights common pitfalls like stack overflow, memory leaks, and address‑space exhaustion, and provides practical C/C++ examples, tuning tips, thread‑pool designs, and debugging tools to keep your multithreaded programs stable and efficient.
This article explains why Linux gives each thread its own stack, describes the historical evolution from LinuxThreads to NPTL, and walks through the glibc implementation that allocates, sizes, and releases thread‑stack memory using mmap and related kernel calls.
This article reviews Linux virtual memory layouts for 32‑bit and 64‑bit systems, explains the different memory segments, shows how the default 8 MiB thread stack impacts virtual address consumption, and calculates practical thread limits based on virtual memory and kernel parameters.
This article details three memory‑saving techniques—reducing default thread stack size, releasing a 130 MB WebView reservation, and shrinking the ART heap—implemented via system‑API hooking and the Patrons library, and evaluates their performance impact on 32‑bit Android devices.
MySQL uses a Thread Cache pool to store idle connection threads, dramatically speeding up client connection creation; understanding parameters like thread_cache_size and thread_stack, monitoring cache hit rates, and proper tuning can keep the hit rate around 90% for optimal performance.
