Tagged articles
memory efficiency
33 articles · Page 1 of 1
This article compares JSONL (JSON Lines) with regular JSON, explaining how line-delimited records enable memory-efficient streaming for logs, machine learning datasets, and ETL pipelines, while detailing tool support in pandas, Spark, and Hugging Face, and clarifying when to stick with standard JSON.
Apache SparkETLHugging Face
0 likes · 21 min read

Honeycomb introduces HexMemory, a constant-size scene memory using six fixed feature planes that enables video world models to maintain long-term spatial consistency without growing memory footprint, outperforming prior methods in loop-closure revisit tasks and novel view synthesis.
HexMemoryconstant-size memorylong video generation
0 likes · 16 min read

This article explains why EasyExcel was archived, introduces FastExcel as a rewrite, details its donation to Apache as Fesod, provides migration steps with code examples, compares performance against alternatives, and recommends Apache Fesod for new and existing projects due to its streaming API, low GC overhead, and Apache Foundation backing.
Apache FesodApache incubatorEasyExcel
0 likes · 16 min read

This article explains why EasyExcel was archived, introduces its successor FastExcel (now Apache Fesod), compares performance and features, provides migration steps with code examples, and recommends Apache Fesod for new and existing projects due to its streaming API, memory efficiency, and Apache Foundation backing.
Apache FesodApache incubatorEasyExcel
0 likes · 15 min read

The article reviews Coleman Hooper's 2026 Berkeley PhD thesis, which shows that LLM inference is increasingly limited by memory bandwidth and capacity, and proposes a four‑pronged approach—weight quantization, KV‑cache quantization, selective context loading, and multipole attention—to dramatically improve memory efficiency and throughput.
AttentionKV CacheLLM
0 likes · 12 min read

BigMac introduces a dependency‑safe nested pipeline that keeps the LLM schedule intact while inserting encoder and generator work, achieving 1.08‑1.9× speedup and stable GPU memory usage across large‑scale multimodal LLM training workloads.
BigMacPipeline Parallelismmemory efficiency
0 likes · 17 min read

BigMac introduces a dependency‑safe nested pipeline that preserves LLM compute efficiency while reducing encoder and generator activation memory to O(1), delivering 1.08‑1.9× speedup and stable memory usage for large‑scale multimodal model training.
Nested PipelinePipeline Parallelismcompute efficiency
0 likes · 15 min read

The article explains how a Redis‑backed Bloom filter can deduplicate activity pop‑ups for 30 million users using only 35 MB of memory, compares alternative approaches, and details the underlying bit‑array and hash‑function mechanics, false‑positive rate, parameter sizing, expiration, and practical library choices.
Bloom FilterFalse positiveJava
0 likes · 15 min read

Flash‑KMeans is a newly proposed framework that re‑designs exact K‑Means for GPUs by eliminating distance‑matrix materialization, using FlashAssign’s online argmin and Sort‑Inverse Update to cut memory bandwidth and atomic‑write contention, achieving up to 12.5× speedup and dramatically lower VRAM usage on billion‑point datasets.
FlashAssignGPUK-Means
0 likes · 23 min read

The article analyzes the KV‑Cache memory bottleneck of long‑context Transformers, introduces the KV‑CAT (KV‑Compression Aware Training) approach that simulates cache compression during pre‑training, and presents experiments showing unchanged base abilities while dramatically improving post‑training compression, retrieval and long‑text QA performance.
KV CacheKV-CATTransformer
0 likes · 10 min read

This article explains how Go struct pointers work, compares value and pointer passing with concrete code examples, demonstrates memory and speed benefits for large structs, shows how to use pointers in function parameters and interfaces, and provides best‑practice guidelines and a real‑world case study showing up to 70% memory savings and 40% speed gains.
Best PracticesGomemory efficiency
0 likes · 9 min read


SuanNiMar 20, 2026 · Artificial Intelligence
Mamba-3 achieves the same performance as its predecessors with half the memory by introducing a novel exponential trapezoidal discretization, complex-valued state spaces, and a multi‑input‑multi‑output architecture, dramatically improving hardware efficiency, logical reasoning, and benchmark scores across a range of language tasks.
AI ModelMamba-3hardware optimization
0 likes · 10 min read

DeepSeek's new mHC architecture projects residual connections onto a manifold, enabling a 6.7% training cost increase for 27B models while delivering significant stability and downstream performance gains over traditional residual and hyper‑connection designs.
LLMManifold OptimizationPipeline Parallelism
0 likes · 13 min read

The article examines how treating PHP variables as interchangeable reusable resources could reduce memory usage, boost execution speed, and simplify code, while outlining current limitations, possible implementation strategies, challenges, and practical scenarios where such a feature would be beneficial.
PHPVariable Managementbackend development
0 likes · 6 min read

The 2025 open‑source reports reveal major advances in large‑model engineering, including drastic cost cuts such as DeepSeek‑V3 training for $5.57 M, performance gains where Gemma 3 4B matches Gemma 2 27B, memory efficiencies like 85 % KV‑cache reduction, and a suite of new techniques—from loss‑free MoE balancing to multi‑token prediction—that together push context lengths to one million tokens and enable multimodal, aligned, and industry‑specific models.
Reinforcement Learningattention mechanismscost reduction
0 likes · 13 min read

Learn how Python list comprehensions work, transform them into generators for memory-efficient iteration, understand the differences between iterables, iterators, and generators, and see practical code examples including a Fibonacci generator and iterator conversion techniques.
Pythongeneratorsiterators
0 likes · 6 min read

DeepSeek‑V3.1 introduces the UE8M0 FP8 Scale precision, cutting memory usage by up to 75% and enabling next‑generation Chinese chips such as Ascend 910B to run 128K context models efficiently, while the ecosystem rapidly adopts FP8, yet challenges in IP autonomy and software maturity remain before global competitiveness is achieved.
AI hardwareDeepSeekFP8
0 likes · 10 min read

This article explains Python's shallow and deep copy mechanisms, detailing their definitions, implementation methods, memory implications, and practical scenarios, supplemented with clear analogies, code examples, and performance considerations to help developers choose the appropriate copying technique.
Code ExamplesDeep CopyPython
0 likes · 14 min read

Python generator functions, using the yield keyword, enable lazy evaluation and memory-efficient data processing, with examples covering basic syntax, differences from regular functions, Fibonacci sequence generation, large file reading, two-way communication via send(), and control methods like throw() and close(), highlighting their advantages.
Code ExamplesPythongenerator
0 likes · 4 min read

DeepSeek‑V3 demonstrates that a tightly coupled hardware‑software design—featuring a memory‑saving MLA cache, a compute‑efficient DeepSeekMoE, a multi‑token prediction module, FP8 training, LogFMT compression, and an optimized eight‑plane fat‑tree network—can train a competitive LLM with only 2,048 H800 GPUs, cutting compute by up to 80% and boosting generation speed by 1.8×.
DeepSeek-V3FP8 trainingLLM
0 likes · 12 min read

This article demystifies Python’s for-loop by explaining how iterable objects and iterators work under the hood, illustrating the iterator protocol with code examples, and providing practical custom iterator implementations, common pitfalls, and tips for efficient data processing.
IterablePythondata processing
0 likes · 9 min read

This article explains Python's built‑in range function, covering its lazy generation, memory efficiency, syntax variations, practical examples, common pitfalls, and advanced techniques such as reverse iteration and enumeration.
iterationlazy evaluationmemory efficiency
0 likes · 7 min read

This article explains Python's list comprehensions, demonstrates how to create and use generators for memory‑efficient iteration, compares iterators and iterable objects, and provides practical code examples including a generator‑based Fibonacci sequence, helping readers understand and apply these core concepts in their programs.
Pythongeneratorsiterators
0 likes · 6 min read

This article compares Python's list comprehensions and generator expressions, highlighting differences in memory usage, execution timing, reusability, suitable scenarios, and how to convert each into other sequence types, with clear code examples for each point.
Pythongenerator expressioniteration
0 likes · 5 min read

This article explains Python generator functions, their memory‑efficient iteration mechanism, and demonstrates through multiple examples—including basic generators, Fibonacci sequences, large file processing, HTTP streaming, and API test data generation—how they can streamline and optimize interface automation testing workflows.
api-testingautomationgenerator
0 likes · 10 min read


21CTOApr 18, 2024 · Backend Development
This article shares the author's experience building a fully Rust‑based web service called JustFax, covering its architecture, memory efficiency, safety, async handling, type safety benefits, and the challenges of Rust's complexity, borrow checker, compile times, and ecosystem compared to Node.js.
Backendmemory efficiencytype safety
0 likes · 7 min read

This article explores how counters, especially 24‑bit timestamps, are employed in Redis’s LRU eviction algorithm and other memory‑constrained scenarios, detailing implementation tricks, precision trade‑offs, and practical code examples for efficient cyclic counters and compact storage techniques.
CountersLRUbitwise-operations
0 likes · 12 min read

This article presents ten practical Python examples illustrating lazy evaluation using generators and iterators, covering infinite sequences, large data processing, file streaming, and on-demand computation, highlighting memory efficiency and performance benefits for handling big data and infinite streams.
Infinite SequencesPythongenerators
0 likes · 7 min read

This article explains lazy evaluation in functional programming and presents ten Python code examples that demonstrate how generators and iterators can efficiently handle infinite sequences and large‑scale data by computing values only when needed.
Infinite SequencesPythongenerators
0 likes · 7 min read

This article introduces the HG‑LDP framework, which combines local differential privacy with the HeavyGuardian data structure to enable accurate, privacy‑preserving high‑frequency item statistics on streaming data while using only limited memory, and evaluates four algorithmic variants (BGR, DSR, BDR, CNR) through extensive experiments on synthetic and real‑world datasets.
HeavyGuardianHigh-Frequency ItemLocal Differential Privacy
0 likes · 19 min read


AntTechMay 24, 2022 · Artificial Intelligence
The paper introduces WPipe, a group‑based interleaved pipeline parallelism method that reduces memory overhead and weight‑update latency compared with PipeDream‑2BW, achieving up to 1.4× speed‑up and 36% lower memory usage while preserving model accuracy on large‑scale DNNs.
Pipeline ParallelismTraining ThroughputWPipe
0 likes · 13 min read

This article critically examines common claims that Memcached is superior for caching by comparing its design, threading, disk I/O, memory efficiency, LRU behavior, smart caching features, persistence, replication, observability, and Lua scripting capabilities against Redis, concluding that the two systems have distinct trade‑offs depending on use case.
Lua scriptingMemcachedmemory efficiency
0 likes · 9 min read

This article introduces three advanced data structures—Unrolled List, Bloom Filter, and Skip List—explaining their design motivations, memory and performance trade‑offs, and providing C++ code snippets to illustrate their core implementations.
Bloom FilterSkip ListUnrolled List
0 likes · 8 min read
