Skip to content
Tagged articles

huge pages

12 articles · Page 1 of 1
ITPUB
ITPUB
Oct 30, 2026 · Operations

Why Switching Linux Page Size from 4KB to 2MB Crashed My Production Services

The author recounts a production incident where blindly enabling 2MB huge pages for a microservice workload caused 30% memory bloat, CPU soft-interrupt spikes, and latency degradation, then explains the TLB vs. fragmentation trade-offs that make huge pages suitable only for large, contiguous memory workloads like databases.

LinuxPerformance TuningTLB
0 likes · 20 min read
Why Switching Linux Page Size from 4KB to 2MB Crashed My Production Services
Deepin Linux
Deepin Linux
Oct 22, 2026 · Backend Development

Memory Optimization Deep Dive: Allocate Less, Allocate Faster, Use Efficiently

This article presents a systematic approach to memory optimization across three dimensions—reducing allocation frequency, accelerating allocation speed, and improving memory usage efficiency—with practical C++ techniques including stack allocation, object pools, size-class allocators, huge pages, data structure packing, and false sharing prevention.

C++Performance Tuningdata structure alignment
0 likes · 23 min read
Memory Optimization Deep Dive: Allocate Less, Allocate Faster, Use Efficiently
IT Services Circle
IT Services Circle
Jun 7, 2026 · Fundamentals

Why Switching Linux Page Size to 2 MiB Can Skyrocket Performance

The article explains how the default 4 KiB pages cause frequent TLB misses, how using 2 MiB huge pages expands a single TLB entry’s coverage by 512×, reduces page‑walk depth and page‑table overhead, and provides C++ examples for both hugetlbfs and Transparent Huge Pages.

C++LinuxTLB
0 likes · 7 min read
Why Switching Linux Page Size to 2 MiB Can Skyrocket Performance
Liangxu Linux
Liangxu Linux
Feb 5, 2024 · Fundamentals

Why Is the First memset So Slow? Exploring Page Faults, TLB, and Huge Pages

The article explains why the initial memset on a newly‑allocated 1 GB buffer is much slower than subsequent calls, detailing how page‑fault handling, TLB misses, and the MMU’s multi‑level page tables cause overhead, and demonstrates optimizations such as using huge pages, MAP_POPULATE, and pre‑mapping to eliminate the slowdown.

TLBhuge pagesmemory-management
0 likes · 20 min read
Why Is the First memset So Slow? Exploring Page Faults, TLB, and Huge Pages
AI Cyberspace
AI Cyberspace
Mar 24, 2023 · Fundamentals

Unlock Faster Linux Performance with Huge Pages: Why and How

This article explains Linux huge pages, their performance benefits, implementation details, configuration steps, and the impact on memory reporting, including guidance on using and disabling Transparent Huge Pages for optimal system tuning.

LinuxTLBhuge pages
0 likes · 14 min read
Unlock Faster Linux Performance with Huge Pages: Why and How
ByteDance SYS Tech
ByteDance SYS Tech
Feb 10, 2023 · Fundamentals

Mastering Linux Memory: Reclaim, Huge Pages, and NUMA Optimization

This article explains common Linux memory‑related performance bottlenecks—such as memory reclamation, page‑cache pressure, huge‑page usage, and cross‑NUMA access—and provides practical tuning methods to improve latency and throughput on servers and applications.

NUMAhuge pages
0 likes · 16 min read
Mastering Linux Memory: Reclaim, Huge Pages, and NUMA Optimization
Open Source Linux
Open Source Linux
Aug 21, 2021 · Operations

Linux Huge Pages vs Transparent Huge Pages: Benefits, Risks, and Disabling Guide

This article explains the two types of Linux huge pages—static HugeTLB pages and dynamic Transparent Huge Pages—detailing their sizes, performance advantages, drawbacks, especially for Oracle workloads, and provides step‑by‑step instructions for checking status and permanently disabling THP via sysfs or GRUB.

Linuxhuge pagesmemory management
0 likes · 9 min read
Linux Huge Pages vs Transparent Huge Pages: Benefits, Risks, and Disabling Guide
Ops Development Stories
Ops Development Stories
Nov 11, 2020 · Backend Development

Unlocking DPDK Performance: Key Insights and Optimization Techniques

This article summarizes essential concepts and practical optimization strategies for DPDK, covering architecture fundamentals, x86 performance analysis, virtualization overhead, NFV forwarding bottlenecks, huge‑page usage, polling modes, CPU affinity, and I/O virtualization techniques to achieve high‑throughput, low‑latency packet processing.

CPU affinityDPDKNFV
0 likes · 30 min read
Unlocking DPDK Performance: Key Insights and Optimization Techniques