BestHub
Sign in
Tagged articles

Memory Efficiency

29 articles · Page 1 of 1
Data Party THU
Data Party THU
Aug 8, 2026 · Artificial Intelligence

Memory-Efficient Algorithms for Large Language Model Inference

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.

KV cacheLLMMemory Efficiency
0 likes · 12 min read
Memory-Efficient Algorithms for Large Language Model Inference
samdeepthink
samdeepthink
Jul 7, 2026 · Fundamentals

How a Bloom Filter Stores 30 Million Items in Just 35 MB

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 positiveMemory Efficiency
0 likes · 15 min read
How a Bloom Filter Stores 30 Million Items in Just 35 MB
DeepHub IMBA
DeepHub IMBA
Jun 15, 2026 · Artificial Intelligence

Flash-KMeans: Fast, Memory-Efficient Exact K-Means for Billion-Scale Clustering on a Single GPU

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.

ClusteringFlashAssignGPU
0 likes · 23 min read
Flash-KMeans: Fast, Memory-Efficient Exact K-Means for Billion-Scale Clustering on a Single GPU
Machine Heart
Machine Heart
Jun 2, 2026 · Artificial Intelligence

Training Transformers to Be Compression‑Friendly: A New Memory‑Discard Paradigm

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-CATLarge Language Models
0 likes · 10 min read
Training Transformers to Be Compression‑Friendly: A New Memory‑Discard Paradigm
Go Development Architecture Practice
Go Development Architecture Practice
Apr 20, 2026 · Fundamentals

Why Go Struct Pointers Boost Performance: Deep Dive and Best Practices

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.

GoMemory Efficiencybest practices
0 likes · 9 min read
Why Go Struct Pointers Boost Performance: Deep Dive and Best Practices
SuanNi
SuanNi
Mar 20, 2026 · Artificial Intelligence

How Mamba-3 Halves Memory Use While Boosting Logic Reasoning

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-3Memory Efficiency
0 likes · 10 min read
How Mamba-3 Halves Memory Use While Boosting Logic Reasoning
php Courses
php Courses
Nov 18, 2025 · Backend Development

Can PHP Swap Variables Like Reusable Resources? Exploring Performance Gains

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.

Memory EfficiencyPHPVariable Management
0 likes · 6 min read
Can PHP Swap Variables Like Reusable Resources? Exploring Performance Gains
AI2ML AI to Machine Learning
AI2ML AI to Machine Learning
Oct 1, 2025 · Artificial Intelligence

2025 Large Model Engineering Breakthroughs: Cutting Costs, Boosting Performance, and Extending Context

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.

Attention MechanismsLarge Language ModelsMemory Efficiency
0 likes · 13 min read
2025 Large Model Engineering Breakthroughs: Cutting Costs, Boosting Performance, and Extending Context
Architects' Tech Alliance
Architects' Tech Alliance
Aug 26, 2025 · Artificial Intelligence

How DeepSeek‑V3.1’s New FP8 Precision Supercharges Domestic Chip Performance

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
How DeepSeek‑V3.1’s New FP8 Precision Supercharges Domestic Chip Performance
Python Programming Learning Circle
Python Programming Learning Circle
Jul 23, 2025 · Fundamentals

Master Python Deep vs Shallow Copy: Definitions, Memory Efficiency & Use Cases

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.

Memory EfficiencyPythonShallow Copy
0 likes · 14 min read
Master Python Deep vs Shallow Copy: Definitions, Memory Efficiency & Use Cases
Test Development Learning Exchange
Test Development Learning Exchange
May 17, 2025 · Fundamentals

Understanding Python Generator Functions: Syntax, Usage, and Practical Examples

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.

IteratorsMemory EfficiencyPython
0 likes · 4 min read
Understanding Python Generator Functions: Syntax, Usage, and Practical Examples
Software Engineering 3.0 Era
Software Engineering 3.0 Era
May 15, 2025 · Artificial Intelligence

DeepSeek‑V3 Paper Reveals Breakthrough Hardware‑Software Co‑Design for AI Efficiency

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 trainingHardware‑software co‑design
0 likes · 12 min read
DeepSeek‑V3 Paper Reveals Breakthrough Hardware‑Software Co‑Design for AI Efficiency
Code Mala Tang
Code Mala Tang
Apr 15, 2025 · Fundamentals

What Really Happens Inside a Python for-loop? Uncover the Magic of Iterators

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.

Data ProcessingIterableMemory Efficiency
0 likes · 9 min read
What Really Happens Inside a Python for-loop? Uncover the Magic of Iterators
MaGe Linux Operations
MaGe Linux Operations
Feb 19, 2025 · Fundamentals

Master Python Iterators & Generators: List Comprehensions, Memory‑Efficient Loops, and Fibonacci

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.

IteratorsMemory EfficiencyPython
0 likes · 6 min read
Master Python Iterators & Generators: List Comprehensions, Memory‑Efficient Loops, and Fibonacci
Test Development Learning Exchange
Test Development Learning Exchange
Oct 1, 2024 · Fundamentals

Understanding Python Generator Functions and Their Applications in API Automation Testing

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.

AutomationIteratorMemory Efficiency
0 likes · 10 min read
Understanding Python Generator Functions and Their Applications in API Automation Testing
21CTO
21CTO
Apr 18, 2024 · Backend Development

Why Rust Beats Node.js for Web Services: Lessons from Building JustFax

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.

Memory Efficiencybackendtype safety
0 likes · 7 min read
Why Rust Beats Node.js for Web Services: Lessons from Building JustFax
MaGe Linux Operations
MaGe Linux Operations
Dec 14, 2023 · Backend Development

How Redis Uses 24‑Bit Counters for Efficient LRU Caching

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.

C programmingCountersLRU
0 likes · 12 min read
How Redis Uses 24‑Bit Counters for Efficient LRU Caching
Test Development Learning Exchange
Test Development Learning Exchange
Dec 11, 2023 · Fundamentals

10 Practical Scenarios Demonstrating Lazy Evaluation and Infinite Sequence Handling in Python

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 SequencesMemory EfficiencyPython
0 likes · 7 min read
10 Practical Scenarios Demonstrating Lazy Evaluation and Infinite Sequence Handling in Python
DataFunSummit
DataFunSummit
Jul 22, 2023 · Information Security

HG‑LDP: A Memory‑Efficient Framework for High‑Frequency Item Statistics under Local Differential Privacy

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
HG‑LDP: A Memory‑Efficient Framework for High‑Frequency Item Statistics under Local Differential Privacy
AntTech
AntTech
May 24, 2022 · Artificial Intelligence

WPipe: Group‑Based Interleaved Pipeline Parallelism for Large‑Scale DNN Training

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.

Memory EfficiencyPipeline ParallelismTraining Throughput
0 likes · 13 min read
WPipe: Group‑Based Interleaved Pipeline Parallelism for Large‑Scale DNN Training
Architect
Architect
Dec 2, 2015 · Databases

Redis vs Memcached: Clarifications and Comparative Analysis

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
Redis vs Memcached: Clarifications and Comparative Analysis