BestHub
Sign in
Tagged articles
18 articles
Page 1 of 1
Deepin Linux
Deepin Linux
May 11, 2026 · Fundamentals

Eliminate Memory Fragmentation: Understanding Memory Pools

The article explains how frequent dynamic allocations cause external and internal memory fragmentation, illustrates the problem with C++ examples, and shows that pre‑allocating a large contiguous block as a memory pool—managed via block division, free‑list tracking, and thread‑safe operations—significantly reduces fragmentation, improves allocation speed, and boosts concurrency performance.

CMemory FragmentationPerformance Optimization
0 likes · 30 min read
Eliminate Memory Fragmentation: Understanding Memory Pools
IT Services Circle
IT Services Circle
Dec 22, 2025 · Fundamentals

How Go’s Runtime Manages Memory: From Kernel SLAB to mheap and mcache

This article explains Go's memory allocator by comparing it with the Linux kernel SLAB allocator, detailing the page‑heap (mheap), span structures, per‑P caches (mcache), and the mallocgc path for small and large allocations, while showing key source code snippets and diagrams.

GoMemory ManagementRuntime
0 likes · 18 min read
How Go’s Runtime Manages Memory: From Kernel SLAB to mheap and mcache
Deepin Linux
Deepin Linux
Oct 5, 2025 · Fundamentals

Why Stack Memory Is Faster Than Heap: Deep Dive into Allocation Mechanics

This article explains the fundamental differences between stack and heap memory allocation, covering their mechanisms, performance characteristics, common pitfalls such as overflow and leaks, and practical coding examples in C and C++, helping developers choose the right memory strategy for efficient software design.

Callocationperformance
0 likes · 63 min read
Why Stack Memory Is Faster Than Heap: Deep Dive into Allocation Mechanics
Deepin Linux
Deepin Linux
Sep 17, 2025 · Fundamentals

Why new/delete Beats malloc/free: A Deep Dive into C/C++ Memory Management

This article explains the core differences between C's malloc/free and C++'s new/delete, covering allocation mechanisms, object construction and destruction, error handling, common pitfalls, and best practices—including smart pointers—to help developers choose the right memory management approach for various programming scenarios.

Callocationmalloc
0 likes · 32 min read
Why new/delete Beats malloc/free: A Deep Dive into C/C++ Memory Management
Deepin Linux
Deepin Linux
Aug 24, 2025 · Fundamentals

Why Is Stack Memory Faster Than Heap? A Deep Dive into Stack vs. Heap Allocation

This article explains the fundamental differences between stack and heap memory allocation, covering their allocation mechanisms, performance characteristics, common pitfalls such as stack overflow and memory leaks, practical code examples in C/C++, and typical interview questions to help developers choose the right memory model for their applications.

CHeapMemory Management
0 likes · 65 min read
Why Is Stack Memory Faster Than Heap? A Deep Dive into Stack vs. Heap Allocation
Deepin Linux
Deepin Linux
Aug 23, 2025 · Fundamentals

How Does delete Know Memory Size? A Deep Dive into C++ Memory Management

This article explains C++ memory management fundamentals, detailing how delete and free release memory without explicit size knowledge, the role of stack, heap, data and code segments, differences between new/delete and malloc/free, array handling, common pitfalls, and interview questions with code examples.

CDELETEFree
0 likes · 34 min read
How Does delete Know Memory Size? A Deep Dive into C++ Memory Management
Deepin Linux
Deepin Linux
Mar 21, 2025 · Fundamentals

Understanding Memory Pools: Concepts, Implementations, and Practical Use Cases

This article explains the concept of memory pools, how they reduce allocation overhead and fragmentation compared to traditional malloc/new, describes various pool designs and Linux kernel APIs, provides multiple C and C++ implementations, and discusses performance benefits and typical application scenarios such as servers, real‑time and embedded systems.

C++Linux kernelallocation
0 likes · 40 min read
Understanding Memory Pools: Concepts, Implementations, and Practical Use Cases
AntData
AntData
Mar 14, 2025 · Fundamentals

Analysis of DeepSeek 3FS Storage Service Architecture and Design

This article provides an in‑depth technical analysis of DeepSeek's open‑source 3FS distributed file system, focusing on the StorageService architecture, space pooling, allocation mechanisms, reference counting, fragmentation handling, and the RDMA‑based read/write data path.

RDMAZero Copyallocation
0 likes · 15 min read
Analysis of DeepSeek 3FS Storage Service Architecture and Design
Code Wrench
Code Wrench
Aug 21, 2024 · Fundamentals

OS Memory Management Explained: Allocation Strategies & Page Replacement in Go

This article delves into operating system memory management, covering continuous and fragmented allocation strategies such as First‑Fit, Next‑Fit, Best‑Fit, and Worst‑Fit, explains swapping and overlay techniques, analyzes page replacement algorithms like Optimal, FIFO, and LRU, and offers practical Go implementations and optimization tips.

Memoryallocationos
0 likes · 12 min read
OS Memory Management Explained: Allocation Strategies & Page Replacement in Go
Deepin Linux
Deepin Linux
Aug 5, 2024 · Fundamentals

Understanding Linux Kernel Memory Pools and Their Implementation

This article explains the concept, benefits, and implementation details of memory pools in the Linux kernel, covering allocation functions, design principles, common strategies, and a thread‑safe C++ memory‑pool class with example code.

C++Linux kernelallocation
0 likes · 27 min read
Understanding Linux Kernel Memory Pools and Their Implementation
DataFunSummit
DataFunSummit
Mar 7, 2023 · Operations

Intelligent Replenishment and Allocation Algorithms in Alibaba Health's Pharmaceutical E‑commerce Supply Chain

The article presents a comprehensive overview of Alibaba Health's supply‑chain algorithms for intelligent replenishment and allocation, detailing the overall architecture, model evolution from safety‑stock to reinforcement learning, simulation validation, multi‑objective optimization, and practical Q&A on deployment.

Alibaba HealthOperations ResearchSupply Chain
0 likes · 23 min read
Intelligent Replenishment and Allocation Algorithms in Alibaba Health's Pharmaceutical E‑commerce Supply Chain
Bin's Tech Cabin
Bin's Tech Cabin
Dec 28, 2022 · Fundamentals

How Linux Allocates Physical Memory: Inside the Kernel’s Buddy Allocator

This article walks through Linux kernel physical memory allocation, explaining the hierarchy of allocation interfaces, the role of gfp_mask and ALLOC flags, the fast and slow allocation paths, memory watermarks, NUMA zone handling, and the complex fallback mechanisms including compaction, direct reclaim, and OOM, all illustrated with code snippets and diagrams.

LinuxMemory ManagementNUMA
0 likes · 68 min read
How Linux Allocates Physical Memory: Inside the Kernel’s Buddy Allocator
Alimama Tech
Alimama Tech
Feb 9, 2022 · Artificial Intelligence

Online Allocation Strategies for Guaranteed Display Advertising: Modeling, Distributed Solving, and Adaptive Pacing

The paper presents a guarantee‑based, distributed allocation framework for Alibaba’s off‑site brand contract ads that extends the SHALE algorithm with effect‑driven objectives and explicit over‑allocation constraints, solves dual variables via coordinate descent, and employs adaptive probability‑based pacing to meet volume guarantees while significantly boosting average CTR.

Online Optimizationallocationguaranteed display
0 likes · 11 min read
Online Allocation Strategies for Guaranteed Display Advertising: Modeling, Distributed Solving, and Adaptive Pacing
Alibaba Cloud Developer
Alibaba Cloud Developer
Dec 25, 2019 · Operations

Boosting Guaranteed Display Ads with Large‑Scale Personalized Allocation and Real‑Time Pacing

This article presents a large‑scale distributed algorithm for guaranteed‑delivery advertising that incorporates user‑level personalization, solves a bipartite matching problem with complex constraints, and introduces a real‑time pacing module to smooth delivery while maximizing platform revenue and advertiser satisfaction.

Advertisingallocationdistributed optimization
0 likes · 22 min read
Boosting Guaranteed Display Ads with Large‑Scale Personalized Allocation and Real‑Time Pacing
High Availability Architecture
High Availability Architecture
Oct 17, 2019 · Fundamentals

Memory Allocation vs. Pooling: Performance Analysis Across Java, G1, ZGC, and C++

This article investigates whether to allocate new memory for each incoming message or to reuse memory from a pool, analyzing the impact on throughput and latency in batch and soft‑real‑time applications, and presenting extensive benchmark results for various garbage collectors, JVM options, and native C++ implementations.

JavaMemory ManagementPerformance Testing
0 likes · 31 min read
Memory Allocation vs. Pooling: Performance Analysis Across Java, G1, ZGC, and C++