Tagged articles
allocation
19 articles · Page 1 of 1
The article explains the core responsibilities and three‑layer architecture of a marketing PMS, details the activity‑template model, walks through the rule‑engine execution flow with container‑component and needNum logic, compares self‑built and Drools solutions, and describes mutual‑exclusion, stacking, allocation strategies, and the three‑stage cal/use/rollback workflow with caching and consistency safeguards.
BackendJavaallocation
0 likes · 24 min read

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.
C++Low-Level ProgrammingMultithreading
0 likes · 30 min read

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.
GoRuntimeSLAB
0 likes · 18 min read

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.
C++allocationperformance
0 likes · 63 min read

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.
C++allocationmalloc
0 likes · 32 min read

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.
C++HeapInterview
0 likes · 65 min read

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.
C++DELETEHeap
0 likes · 34 min read

The article explains how memory pools reduce allocation overhead and fragmentation by pre‑allocating large memory blocks, describes their implementation in C++ and the Linux kernel, compares various pool designs, and shows practical scenarios where pools improve performance and stability.
C++Linux kernelallocation
0 likes · 37 min read

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

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.
RDMAallocationchunk management
0 likes · 15 min read

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

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.
Linux kernelallocationfragmentation
0 likes · 18 min read

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

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 Researchallocation
0 likes · 23 min read

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.
LinuxNUMAallocation
0 likes · 68 min read

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

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

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.
Javaallocationmemory management
0 likes · 31 min read

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.
GCGoallocation
0 likes · 16 min read
