This article compares Rust and Go memory management by using a house‑rental analogy, detailing Go's garbage‑collector landlord model and Rust's compile‑time caretaker model, illustrating each with code snippets, pros and cons, real‑world performance anecdotes, and a practical scenario matrix.
The article follows a senior Go developer who migrated a mutex‑based key/value store from Go to Zig 0.16, comparing language ergonomics, memory management, concurrency models, code size, and ecosystem maturity, and concludes whether Zig can become the ultimate system‑programming choice.
The article explains OpenClaw Memory's design—storing daily and permanent logs as Markdown files, managing them with Git, offering hybrid vector‑BM25 search, applying temporal decay to prioritize recent entries, and comparing SQLite and QMD backends with practical configuration examples and tips.
This article explains how the Agent Loop—an engineered while‑loop that repeatedly calls an LLM, decides when to use tools, executes them, and feeds results back—creates persistence, style, memory, judgment, and safety boundaries that together make an AI agent feel like it has its own personality.
This article explains the fundamentals of Linux memory management, details how shared memory implements zero‑copy inter‑process communication, and provides step‑by‑step code examples of system calls, mmap, sendfile, splice, and synchronization techniques for high‑performance data transfer.
This chapter uses vivid analogies and exam‑focused breakdowns to explain the Von Neumann architecture, CPU performance metrics, memory hierarchy, operating‑system concepts such as processes, threads, scheduling, memory management, virtual memory, file systems and deadlock, showing how mastering these basics gives architects a decisive edge in system‑design exams.
This comprehensive guide walks you through the real costs of Redis memory problems, explains the three‑layer memory architecture and five major consumers, provides a toolbox of INFO and MEMORY commands plus monitoring scripts, and offers step‑by‑step solutions for seven common issues, best‑practice optimizations, real‑world case studies, a daily checklist, and advanced techniques such as Lua scripts and smart cache warm‑up.
This article dissects OpenClaw’s engineering techniques for building robust, production‑level AI agents, covering zero‑trust tool policies for security, markdown‑based memory management, cost‑aware reasoning levels, and controlled sub‑agent collaboration to ensure safety, efficiency, and reliability.
A veteran kernel engineer argues that while AI academia floods the field with "AI-for-kernel" papers, few reach mainline due to community conservatism and engineering gaps; instead, kernel developers should focus on "kernel-for-AI" optimizations—scheduling, memory, I/O for AI workloads—where real impact lies.
Go 1.26 adds a new capability to the built‑in new function, allowing it to take any expression, copy the result into a temporary variable and return a pointer, which eliminates the need for helper functions, prevents hidden memory leaks and yields measurable performance gains, as shown by concrete benchmarks and compiler‑level escape‑analysis explanations.
This comprehensive guide walks Java backend developers through the fundamentals of AI agents, comparing agents with traditional workflows, detailing core components such as LLMs, tools, and memory, and exploring practical patterns, frameworks, and code examples to help them successfully shift into AI agent development.
This article demystifies short‑term and long‑term memory in LLM‑driven autonomous agents, explaining their mechanisms, limitations, and practical implementations such as sliding windows, summarization, and vector‑based retrieval, while illustrating each concept with concrete Cherry Studio examples and relevant research references.
This article dissects OpenClaw’s architecture, revealing how a TypeScript CLI process, a gateway server, lane‑queue concurrency, structured memory, tool‑execution allowlists, and semantic browser snapshots combine to turn fragile AI agents into stable, observable, and controllable systems.
The article outlines the core building blocks of AI agents—including frontend frameworks, development kits, tool integration, memory strategies, design patterns, model selection, and runtime environments—while explaining how each choice impacts performance, scalability, cost, and security.
Alibaba's new AgeMem framework turns long‑term and short‑term memory management for large language model agents into a learnable reinforcement‑learning task, replacing handcrafted rules with a three‑stage training process and achieving significant benchmark gains.
This article examines the challenges and possibilities of adding multithreading to PHP, discussing the TrueAsync RFC, single‑threaded + offload patterns, memory‑manager redesign, object movement, shared objects, region‑based memory, and actor models to guide future PHP kernel evolution.
During Pinterest’s migration of its custom search platform Manas to the PinCompute Kubernetes environment, a rare latency spike—one request per million taking 100 times longer—was traced to cAdvisor’s memory‑intensive smaps scans, revealing hidden resource contention and prompting a targeted fix.
This article thoroughly explains Linux shared memory, covering its advantages over other IPC methods, the kernel data structures, virtual‑physical mapping, creation and destruction APIs, copy‑on‑write behavior, and provides complete example code for inter‑process communication.
The article shows that most Java performance problems stem from a simple, often‑overlooked mistake—using immutable String concatenation in loops, large text building, and logging—while demonstrating how StringBuilder, proper logging placeholders, and understanding the string pool can dramatically reduce GC pressure and CPU waste.
DeepAgent, a new end‑to‑end reasoning agent, integrates autonomous thinking, dynamic tool search, and execution to handle over 16,000 APIs, embodied tasks, and research assistance, achieving state‑of‑the‑art performance on benchmarks like TMDB, ToolBench, ALFWorld, WebShop, and GAIA.
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.
The article examines why large language models lack persistent state, outlines the goals and types of memory for AI agents, details design considerations, presents real‑world scenarios and case studies, and compares open‑source frameworks (Mem0, Letta, LangMem) with AWS Bedrock AgentCore’s managed memory solution.
This article reveals how Linux kernel memory layout—its partitions, address allocation, and resource scheduling—directly impacts system stability, explains the roles of each memory region, demonstrates common pitfalls like fragmentation and dentry leaks, and provides practical debugging and optimization techniques for developers and operators.
This article explains the fundamentals of Linux arm64 memory management, covering virtual and physical memory concepts, MMU operation, page table structures, address translation steps, page fault handling, and practical C++ examples for allocation, mapping, and performance optimization using huge pages and pre‑paging techniques.
In long‑running PHP processes, memory usage can steadily increase due to reference counting, circular references, unreleased resources, and default garbage‑collector settings; this article explains the underlying mechanisms, common leak sources, and provides practical debugging tips and best‑practice solutions such as explicit variable cleanup, GC tuning, process restarts, and memory‑efficient extensions.
This article breaks down ComfyUI's two‑level cache system, explains the differences between the CLASSIC, LRU, and RAM_PRESSURE strategies for outputs and objects, and offers practical guidance on choosing the right cache mode when running multiple models, LoRAs, and workflows on a single machine.
When moving from PHP‑FPM to long‑running processes like RoadRunner or Laravel queue workers, memory usage climbs and never drops, a pattern caused by PHP’s Zend memory manager block allocation, reference counting, and GC behavior, which can be mitigated by redesigning code and worker strategies.
This article explains why many enterprise AI agents break down in real projects, identifies four common pitfalls—including mistaking agents for chatbots, lacking schema‑level tool logic, missing memory and variable injection, and absent end‑to‑end pipelines—and offers concrete engineering solutions to build robust, task‑driven agents.
The article explains that operating systems act as resource allocators, isolators, and abstraction layers, enabling multiple programs to share limited CPU, memory, and disk resources safely and efficiently through scheduling, memory partitioning, and hiding hardware complexities.
This article breaks down the exact number of objects created when using a string literal versus the new String constructor in Java, detailing interactions with the constant pool, stack, and heap, and demonstrates the resulting reference comparisons with concrete code examples.
This article provides detailed explanations of ten core MySQL topics—including InnoDB lock upgrades, redo log mechanics, MVCC version chains, tablespace types, page splitting, optimizer plan selection, crash recovery, binlog vs redo log, adaptive hash index, and memory management—along with practical tips for avoiding pitfalls and tuning performance.
This comprehensive guide explains why traditional prompt engineering is insufficient for complex AI agents, defines context engineering as the art of supplying the right information at the right time, outlines its seven core components, describes the phenomenon of context rot, and presents four practical strategies with real‑world case studies such as Claude Code and Manus.
The 20th China Linux Kernel Developers Conference, hosted by vivo, presented eleven technical talks covering AI‑driven kernel challenges, memory‑compression techniques, heterogeneous compression, async file‑cache management, uncached I/O, direct I/O for compressed files, parallel writeback, host‑initiated defragmentation, zoned storage, energy‑efficient I/O, and eBPF‑based CPU idle policies, each with concrete performance results and implementation details.
This article explains how a self‑programming AI Agent is constructed by extending large language models as the brain, designing a multi‑area architecture, implementing memory layers, prompt engineering with segment mechanisms, and enabling code generation and execution through a Python‑Java bridge, while sharing practical insights and future directions.
After noticing 14 GB free RAM but a fully used 29 GB swap, the article explains how to diagnose hidden swap consumption using tools like smem and swap_stat_show, clarifies the difference between free’s Swap used and /proc/*/status VmSwap, and shows how adjusting transparent_hugepage defrag and toggling swap can reclaim the space.
This article introduces the smart-socket Java AIO framework, explains its performance, resource‑efficiency and stability benefits, compares it with alternatives like Netty, and details its modular architecture, core components, extension plugins, and sample code for building high‑performance network applications.
This article explains how to give AI agents persistent memory, reflection, and goal‑tracking by storing interaction summaries in SQLite, embedding them for semantic retrieval with a vector database, and using LLM‑generated prompts to recall, reflect, and manage objectives across sessions.
This comprehensive guide walks you through Linux memory management fundamentals, from prerequisite environments and a quick checklist to step‑by‑step installation of monitoring tools, memory diagnostics, kernel parameter adjustments, THP and swap optimization, NUMA affinity tuning, validation, Prometheus alerts, security hardening, troubleshooting, rollback procedures, best‑practice recommendations, and ready‑to‑use scripts and configuration snippets.
Android 15 introduces 16KB memory pages, requiring native libraries to align accordingly; this change improves TLB efficiency, reduces CPU load, speeds up cold starts, and lowers battery consumption, while Google Play mandates compliance by November 2025, prompting developers to audit and rebuild affected .so files using provided tools.
This article explains how Java handles string literals and `new String()` expressions, detailing when objects are created in the string constant pool versus the heap, and demonstrates the resulting reference comparisons with example code.
This article analyzes a production incident where Redis failed to retrieve keys at 2 AM, tracing the root cause to a short‑term memory write‑full condition caused by massive GET request bursts that overflowed client output buffers, and outlines both emergency fixes and long‑term mitigations.
This article examines recent efforts to make Linux kernel memory management programmable with eBPF, covering BPF‑MM patches for mTHP order, cache‑ext’s customizable LRU, FetchBPF prefetch policies, and BPF OOM hooks, and discusses their design, implementation details, and performance impacts.
The article explains common scenarios that trigger frequent Full GC in Java, such as large object allocation, service timeouts, memory leaks, and old‑generation fragmentation, and offers insights on diagnosing and mitigating these issues to maintain application performance.
This article explores Linux's dynamic memory management, covering virtual and physical memory, user and kernel space separation, paging and segmentation, mmap and brk allocation methods, the slab allocator, malloc/free behavior, and the system's memory reclamation strategies including swap usage.
Linux swap provides a disk‑backed memory extension, storing anonymous pages when RAM runs low; this article explains swap’s operation, the kernel’s memory reclamation thresholds, tuning parameters like min_free_kbytes and swappiness, and offers commands to locate high‑swap processes and safely clear swap.
This article walks through the design and implementation of a two‑layer memory architecture for LangGraph agents, covering short‑term and long‑term stores, various storage back‑ends, prompt engineering, utility functions, node definitions, human‑in‑the‑loop interrupt handling, and how user feedback is captured and used to continuously update the agent’s behavior.
Linux memory management relies on virtual address spaces that map to physical RAM, using page tables, multi-level paging, and dynamic allocation across segments like stack, heap, and mmap, while tools such as free, top, and ps let administrators monitor usage and handle OOM scenarios.
This article walks through a step‑by‑step guide for configuring JVM memory, selecting the right garbage collector, and fine‑tuning parameters to reliably handle a platform receiving one million login requests per day on a service node with 8 GB RAM, covering capacity planning, GC choice, heap sizing, thread stack, object aging, and monitoring.
This article provides a comprehensive technical guide on Agentic AI, detailing the core modules, infrastructure requirements, security considerations, observability practices, and deployment strategies needed to develop and operate production‑ready AI agents.
This article explains why a Docker container reports an out‑of‑memory error even though the host shows over 2 GB of free memory, analyzes the discrepancy between MemFree and MemAvailable, examines Linux memory watermarks, and provides a step‑by‑step solution by adjusting vm.min_free_kbytes.
This guide outlines practical Redis best‑practice rules covering key naming conventions, data‑size limits, expiration strategies, script and transaction usage, client connection handling, and security measures to help you build fast, stable, and secure production systems.
This article examines the diminishing premium of overseas degrees, suggests one‑year master programs for career advancement, and then provides a comprehensive Baidu interview guide covering C++/PHP fundamentals, memory allocation, networking protocols, process vs thread, Redis performance, and a complete quicksort implementation in C++.
A sudden Redis memory surge from 2 GB to 20 GB was traced to a misconfigured list-compress-depth parameter, revealing how uncompressed lists and queue backlogs can cause ten‑fold memory growth, and outlining step‑by‑step diagnostics, compression fixes, and long‑term optimization strategies.
This comprehensive guide walks you through Python performance optimization, covering profiling, algorithmic improvements, data‑structure choices, code‑level tricks, concurrency, memory management, third‑party libraries and a practical checklist to ensure your programs run faster and more efficiently.
This comprehensive guide explores Python’s memory management internals, covering allocation, reference counting, garbage collection, profiling tools, optimization strategies such as slots, generators, array usage, memory views, custom allocators, and practical case studies for big data and web applications, helping developers write faster, more memory‑efficient code.
Version 0.4.0 of the TrueAsync PHP library introduces major performance and memory‑management enhancements, adds asynchronous UDP socket support and SSL for socket streams, fixes numerous bugs, and outlines new requirements and breaking API changes for developers.
Redis implements an approximate LRU using random sampling and timestamps, while classic LRU relies on exact access order; the article explains both LRU and LFU fundamentals, their Java implementations, Redis-specific variants, trade‑offs, use‑case recommendations, and configuration tips for selecting the optimal eviction policy.
This article explains the difference between shallow and deep copying in Python, shows why simple copies can unintentionally modify original data, provides visual memory diagrams, demonstrates multiple copying methods with code examples, compares performance, and offers practical guidelines for choosing the right copy technique in real projects.
This article explains the low‑level mechanisms of brk and mmap in Linux, compares their characteristics, shows why malloc selects one over the other based on allocation size, and provides practical code examples, performance tips, and common pitfalls for developers.
This article explains Linux’s Copy‑On‑Write mechanism, detailing how it avoids full memory duplication during process creation, the underlying page‑table workflow, its implementation in the kernel, and real‑world applications such as Redis persistence, Docker image layering, and filesystem snapshots, while also discussing its advantages and drawbacks.
During Pinterest’s migration of its high‑traffic Manas search platform to the PinCompute Kubernetes environment, engineers observed an extremely rare latency outlier—one in a million requests took 100 times longer—prompting a deep investigation that traced the root cause to cAdvisor’s memory‑intensive smaps scans interfering with leaf node processing.
This comprehensive guide walks you through diagnosing and resolving Redis memory issues, covering the underlying architecture, common pitfalls such as memory leaks and fragmentation, practical diagnostic commands, automated monitoring scripts, and optimization techniques to prevent costly outages and improve performance.
This article explains Linux page faults, describing how the kernel intercepts invalid or unmapped memory accesses, the step‑by‑step handling process, the four typical fault scenarios, and optimization techniques, while providing code examples and diagrams to illustrate virtual‑memory management in depth.
This article demystifies Linux process memory by explaining the layered architecture of virtual and physical memory, the role of the MMU and page tables, dynamic allocation mechanisms such as brk and mmap, and practical tools for inspecting and optimizing memory usage.
This article explains the Linux kernel’s buddy memory allocation algorithm, covering its core principles, data structures, allocation and free workflows, performance advantages and drawbacks, monitoring tools, tuning parameters, and real‑world use cases such as Kubernetes, embedded IoT devices, and real‑time operating systems.
Google’s shift to 16KB memory pages in Android 15, mandatory for Play Store submissions after November 1 2025, brings performance gains, reduces TLB misses, and forces native‑code developers to update build flags and eliminate hard‑coded 4KB assumptions to stay compliant.
This article introduces C++ smart pointers—unique_ptr, shared_ptr, and weak_ptr—explaining their RAII‑based automatic memory management, usage patterns, performance considerations, common pitfalls such as cyclic references, and practical examples including factory patterns and GUI data sharing, while also covering size and custom deleters.
This article explains the fundamental differences between C's malloc/free and C++'s new/delete, covering their underlying mechanisms, proper usage patterns, common pitfalls, error‑handling strategies, and best‑practice recommendations such as smart pointers and memory‑pool techniques.
This guide enumerates thirteen classic C segmentation fault patterns—including null pointer dereference, illegal memory access, stack overflow, buffer overrun, and misuse of dynamic memory—provides concise code examples for each, explains the underlying cause, and offers practical tips to prevent such crashes.
The article analyzes how the newly introduced swap table replaces the kernel's xarray for swapcache, offering O(1) lookups, better locality, reduced lock contention, and lower memory overhead, with benchmark results showing notable performance gains in real workloads.
The article analyzes the new swap table implementation that replaces the kernel's xarray‑based swapcache with a per‑cluster array, offering O(1) lookups, reduced lock contention, lower memory overhead, and measurable performance gains demonstrated by real‑world benchmarks.
This article surveys over 1,400 papers to define context engineering as a systematic discipline that structures retrieval, memory, tools, and multi‑agent coordination for LLMs, highlighting the critical asymmetry between understanding long contexts and generating equally complex outputs.
This article explores the rise of Context Engineering as an essential discipline for large language models, comparing it to Prompt Engineering, detailing its definition, classifications, common pitfalls such as poisoning and distraction, and presenting best‑practice strategies and an LLM‑OS analogy for building robust AI agents.
This article explains Go's memory management mechanisms—including GC fundamentals, stop‑the‑world marking, tri‑color marking with write barriers, hybrid write barriers, and practical optimization techniques such as reducing heap allocations, using caches, concurrency patterns, and profiling tools—to help developers identify and eliminate performance bottlenecks.
A recent Linux kernel patch introduces a unified Swap Table architecture that integrates swap cache, mapping, and allocation, delivering 5%‑20% overall speedups, up to 20% gains in VM scalability, faster builds, and higher Redis/Valkey throughput while reducing memory usage.
This article explains what pointers are in the C language, how to define and use them, common scenarios such as dynamic memory allocation and array handling, and provides a complete, annotated example that demonstrates accessing and modifying variable values through pointers.
This article walks through seventeen classic C programming mistakes that cause segmentation faults—such as null pointers, out‑of‑bounds array access, wild pointers, double frees, and format string bugs—and provides safe, production‑ready code examples to prevent each crash.
When memory usage approaches 90‑95% of capacity, Linux often raises CPU load and stalls instead of invoking OOM, but Alibaba Cloud's FastOOM adds proactive user‑space killing to prevent Near‑OOM livelocks and keep services responsive.
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.
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.
Learn how to dramatically improve Linux server efficiency by addressing common resource bottlenecks with modern CPU scheduling, memory management, I/O scheduler selection, network tuning, and practical diagnostic tools, while also exploring emerging AI‑assisted optimization trends for future‑proof performance.
Starting November 1, 2025, Google Play will require Android apps to support 16KB memory pages, so developers must align native libraries, adjust hard‑coded page size assumptions, verify .so alignment with provided scripts, and choose the appropriate Bugly SDK version to ensure compliance and avoid crashes.
An engineer recounts the hard‑earned lessons from moving beyond RAG to enterprise‑level AI agents, exposing three critical challenges—scheduling, memory management, and tool integration—and proposes architectural patterns that turn fragile prototypes into robust, observable, and secure AI systems.
TencentOS’s recent Swap Table patch series restructures the Linux kernel’s swap subsystem, eliminating long‑standing fragmentation and lock bottlenecks, introducing lock‑free allocation, dynamic swap space, and achieving 20‑30% performance gains and up to 400% higher concurrent throughput in heavy‑load scenarios.
This article explains the JVM Method Area, its purpose in storing class metadata, constants, static variables and JIT-compiled code, and details its six internal components—including the runtime constant pool, field data, method data, class data, constant data, and compiled code—providing essential knowledge for Java developers and interview preparation.
This article dives deep into Swift's Array implementation, explaining how the language allocates memory, the role of SIL and internal structs like _Array, _ArrayBody, and _ContiguousArrayStorage, and how copy‑on‑write ensures efficient mutation handling, all illustrated with real code snippets and debugger output.
This article provides a comprehensive, step‑by‑step exploration of Swift closures on iOS, covering their definition, different forms, practical usage scenarios, the compiler’s SIL generation process, capture list behavior, memory storage details, and best practices for avoiding reference cycles.
This article demystifies Objective‑C blocks by explaining their definition, practical uses, syntax variations, common usage scenarios, underlying data structures and compilation process, copy semantics, variable capture rules, reference‑cycle pitfalls, and provides concise code examples and reference links for iOS developers.
The article explains how replacing the global mmap_lock read lock with per‑VMA locks for madvise MADV_DONTNEED/FREE removes severe lock contention and priority inversion in Linux memory management, and it details the patches, reasoning, and performance evidence supporting the change.
The article analyzes AWS Bedrock AgentCore and related hardware and software requirements for Agentic AI, covering runtime isolation with microVMs, memory architectures, identity and gateway design, zero‑trust networking, and the challenges of multi‑tenant KVCache and context engineering.
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.
Learn how Linux memory management works, from virtual memory and user/kernel space to allocation, reclamation, and common bottlenecks, and discover practical tools like free, top, vmstat, valgrind, jstat, and swap configuration techniques to diagnose, monitor, and optimize server memory for stable, high‑performance operation.
This article explains how the C language enables low‑level hardware control by exposing CPU registers and physical memory, using inline assembly for direct register access, and leveraging pointers to manipulate memory addresses, while also discussing the risks and responsibilities involved.
This article traces the evolution from prompt engineering to context engineering, detailing technical milestones, core concepts, practical strategies, and future trends that together reshape large language model applications and enable sophisticated AI agents across diverse domains.
This article explains the roles and interactions of the Memory Management Unit (MMU), Translation Lookaside Buffer (TLB), and Table Walk Unit (TWU) in virtual‑to‑physical address translation, covering their architecture, operation, and impact on system performance and memory protection.
Attempting to bypass the operating system by directly managing memory, executing privileged CPU instructions, or performing raw hardware I/O from a user‑space application is prohibited; modern OS kernels enforce strict privilege levels, protecting critical data structures and ensuring system stability, and any such attempts are blocked or cause crashes.
Modern C++ applications face severe performance bottlenecks due to traditional memory management techniques like new/delete and malloc/free, which cause fragmentation and high overhead; TCMalloc, a thread‑caching allocator from Google, dramatically reduces latency, improves memory utilization, and scales efficiently across multithreaded workloads.
This article explains why traditional C++ new/delete memory management leads to internal and external fragmentation and performance loss, introduces the concept and principles of memory pools, compares various pool implementations, and provides a complete, thread‑safe example that integrates with std::allocator for high‑efficiency allocation.
This article explains the role of the page‑table cache (TLB) in the Linux kernel, describing how it speeds up virtual‑to‑physical address translation, the underlying mapping process, cache organization, replacement policies, and its impact on system performance across desktops, servers, and high‑performance applications.
Even when scanning a 200 GB InnoDB table on a server with only 100 GB of RAM, MySQL does not consume all memory because it streams results using a limited net_buffer, employs socket send buffers, and InnoDB’s optimized LRU algorithm manages the buffer pool to prevent memory blow‑up.
