allocation | BestHub

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++ConcurrencyLinux kernel

0 likes · 40 min read

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

Deepin Linux

Mar 18, 2025 · Fundamentals

Understanding the Linux Kernel Buddy Memory Allocation Algorithm

This article explains the Linux kernel buddy memory allocation algorithm, covering its basic principles, allocation and reclamation processes, key data structures, initialization steps, code examples, advantages and drawbacks, as well as its applications and evolution across kernel versions.

Buddy AlgorithmMemory ManagementOperating System

0 likes · 36 min read

Understanding the Linux Kernel Buddy Memory Allocation Algorithm

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.

File SystemRDMAZero Copy

0 likes · 15 min read

Analysis of DeepSeek 3FS Storage Service Architecture and Design

Deepin Linux

Dec 13, 2024 · Fundamentals

Understanding the Linux Kernel Buddy Memory Allocation Algorithm

This article explains the Linux kernel buddy system, detailing its data structures, initialization, allocation and free processes, and discusses its advantages and drawbacks in managing physical memory and reducing fragmentation.

Buddy SystemFree AreaMemory Management

0 likes · 22 min read

Deepin Linux

Aug 9, 2024 · Fundamentals

Buddy Algorithm: Principles, Implementation, and Use Cases in Linux Kernel Memory Management

The Buddy Algorithm is a memory‑management technique used by the Linux kernel that splits physical memory into power‑of‑two blocks, tracks them with a binary‑tree structure, and merges free buddies to reduce external fragmentation while providing efficient allocation and deallocation.

Buddy AlgorithmLinux kernelMemory Management

0 likes · 18 min read

Buddy Algorithm: Principles, Implementation, and Use Cases in Linux Kernel Memory Management

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 kernelPerformance

0 likes · 27 min read

Understanding Linux Kernel Memory Pools and Their Implementation

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 Healthallocationinventory optimization

0 likes · 23 min read

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

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.

Large Scaleadvertisingallocation

0 likes · 11 min read

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

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.

C++Garbage CollectionMemory Management

0 likes · 31 min read

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

Xueersi Online School Tech Team

Aug 9, 2019 · Fundamentals

Understanding Go (Golang) Memory Allocation and Management in Go 1.12.6

This article examines Go's memory allocation mechanisms in version 1.12.6, detailing the roles of spans, mcache, mcentral, and mheap, explaining tiny, small, and large object handling, and describing GC and heap reclamation improvements for efficient runtime performance.

GCGoMemory Management

0 likes · 16 min read

Understanding Go (Golang) Memory Allocation and Management in Go 1.12.6