lock-free | BestHub

Tencent Cloud Developer

Apr 28, 2025 · Backend Development

Performance Optimization Techniques for High‑Throughput Backend Systems

The article outlines seven practical performance‑optimization techniques for high‑throughput back‑ends—including replacing protobuf with native C++ classes, adopting cache‑friendly data structures, using jemalloc/tcmalloc, implementing lock‑free double buffers, simplifying structs for specific scenarios, and leveraging profiling tools—while stressing balanced, incremental improvements.

C++Protobufbackend development

0 likes · 16 min read

Performance Optimization Techniques for High‑Throughput Backend Systems

Architecture Development Notes

Jan 26, 2025 · Fundamentals

Master Lock-Free Programming in Rust: Atomic Operations & Memory Ordering

This guide explains how to build high‑performance lock‑free data structures in Rust by using atomic operations, memory ordering semantics, and practical examples such as a thread‑safe counter and a lock‑free stack, followed by best‑practice recommendations.

AtomicRustconcurrency

0 likes · 4 min read

Master Lock-Free Programming in Rust: Atomic Operations & Memory Ordering

Architecture Development Notes

Dec 4, 2024 · Backend Development

How to Build a Zero‑Copy, Low‑Latency Network Protocol in Rust

This article explains how to design and implement a high‑performance custom network protocol in Rust, covering zero‑copy parsing, memory‑mapped packet pools, lock‑free event loops, and an efficient binary packet format to achieve ultra‑low latency and massive concurrency.

RustZero Copyhigh performance

0 likes · 9 min read

How to Build a Zero‑Copy, Low‑Latency Network Protocol in Rust

vivo Internet Technology

Aug 14, 2024 · Backend Development

Understanding Disruptor: High‑Performance In‑Memory Queue, Core Concepts, Demo, and Source Code Analysis

The article explains the Disruptor—an intra‑process, lock‑free, array‑based queue that achieves millions of operations per second—by covering its core concepts, demo code, source‑code mechanics, performance optimizations such as pre‑allocation and false‑sharing avoidance, and real‑world Vivo iTheme applications with best‑practice tips.

DisruptorJavaRing Buffer

0 likes · 29 min read

Understanding Disruptor: High‑Performance In‑Memory Queue, Core Concepts, Demo, and Source Code Analysis

Rare Earth Juejin Tech Community

Aug 13, 2024 · Backend Development

Understanding Java Atomic Variables and Their Applications in Concurrent Programming

This article provides a comprehensive guide to Java atomic variables, explaining their core concepts, underlying CAS mechanism, key classes such as AtomicInteger, AtomicLong, AtomicReference, and AtomicBoolean, and demonstrating practical code examples, use‑cases, performance benefits, limitations, and comparisons with traditional lock‑based synchronization.

Atomic VariablesCASJava

0 likes · 21 min read

Understanding Java Atomic Variables and Their Applications in Concurrent Programming

FunTester

Apr 12, 2024 · Backend Development

Performance Optimization Techniques for Backend Systems: Replacing Protobuf with C++ Classes, Cache‑Friendly Structures, jemalloc, and Lock‑Free Data Structures

The article presents practical backend performance optimization methods—including substituting Protobuf with native C++ classes, employing cache‑friendly data structures, integrating jemalloc/tcmalloc, using lock‑free double‑buffer designs, and tailoring data formats—to achieve up to three‑fold speed improvements and significant latency reductions.

C++Protobufbackend development

0 likes · 15 min read

Performance Optimization Techniques for Backend Systems: Replacing Protobuf with C++ Classes, Cache‑Friendly Structures, jemalloc, and Lock‑Free Data Structures

High Availability Architecture

Mar 6, 2024 · Backend Development

Performance Optimization Techniques: Replacing Protobuf with C++ Classes, Cache‑Friendly Structures, jemalloc, and Lock‑Free Designs

This article presents practical performance‑optimization strategies for high‑throughput C++ services, including replacing Protobuf with hand‑written classes, adopting cache‑friendly data structures, using jemalloc/tcmalloc instead of the default allocator, employing lock‑free double‑buffer designs, tailoring data formats for specific workloads, and leveraging profiling tools to measure gains.

C++OptimizationProtobuf

0 likes · 17 min read

Performance Optimization Techniques: Replacing Protobuf with C++ Classes, Cache‑Friendly Structures, jemalloc, and Lock‑Free Designs

Tencent Cloud Developer

Feb 29, 2024 · Backend Development

Performance Optimization Strategies for High‑Throughput Backend Services

The article outlines practical, continuous performance‑optimization tactics for high‑throughput back‑end services—replacing Protobuf with lightweight C++ classes, using cache‑friendly data structures, adopting jemalloc/tcmalloc, employing lock‑free double buffers, tailoring data formats, and leveraging profiling tools—to achieve multi‑fold speedups while balancing maintainability.

C++Memory ManagementProtobuf

0 likes · 18 min read

Performance Optimization Strategies for High‑Throughput Backend Services

Cognitive Technology Team

Oct 5, 2023 · Backend Development

Lock‑Free Concurrency in Java: CAS, volatile and JUC Utilities

This article explains how Java achieves lock‑free concurrency using CAS and volatile for optimistic locking, discusses its advantages and drawbacks such as the ABA problem and contention hotspots, and presents solutions including versioned CAS classes and contention‑reduction techniques provided by the JUC package.

AtomicCASJUC

0 likes · 6 min read

Lock‑Free Concurrency in Java: CAS, volatile and JUC Utilities

Code Ape Tech Column

Dec 9, 2022 · Backend Development

Disruptor: Simple Usage and Core Components of a High-Performance Lock-Free Queue in Java

This article introduces Java's Disruptor framework as a high-performance, lock-free queue, explains its core components such as RingBuffer, Sequencer, and WaitStrategy, provides sample code for producers and consumers, and discusses how it avoids lock contention and false sharing.

DisruptorJavaconcurrency

0 likes · 12 min read

Disruptor: Simple Usage and Core Components of a High-Performance Lock-Free Queue in Java

Selected Java Interview Questions

Dec 7, 2022 · Backend Development

Understanding Java Disruptor: Queues, Core Components, and High‑Performance Lock‑Free Design

This article introduces various Java queue implementations, explains the Disruptor framework’s architecture, demonstrates its usage with complete code examples, and analyzes core components such as RingBuffer, Sequencer, and WaitStrategy while addressing performance issues like false sharing and multi‑producer coordination.

Concurrent QueueDisruptorJava

0 likes · 12 min read

Understanding Java Disruptor: Queues, Core Components, and High‑Performance Lock‑Free Design

IT Services Circle

Sep 21, 2022 · Backend Development

Understanding HikariCP's ConcurrentBag: A Deep Dive into Lock‑Free Connection Pooling

This article explains how HikariCP's lock‑free ConcurrentBag manages database connections using ThreadLocal caches, a CopyOnWriteArrayList, AtomicInteger waiters, and a SynchronousQueue, and walks through the key code for borrowing and returning connections to improve Java multithreaded performance.

ConcurrentBagConnection PoolHikariCP

0 likes · 11 min read

Understanding HikariCP's ConcurrentBag: A Deep Dive into Lock‑Free Connection Pooling

Cognitive Technology Team

May 22, 2022 · Fundamentals

Lock‑Free (Non‑Blocking) Algorithms and Their Implementation in Java

Lock‑free (non‑blocking) algorithms replace traditional locks with hardware primitives such as compare‑and‑swap (CAS) to ensure data consistency during concurrent access, offering superior scalability and eliminating deadlocks, and the article explains Java’s atomic variables, CAS‑based implementations, and how to address the ABA problem with AtomicStampedReference.

ABAAtomicCAS

0 likes · 5 min read

Lock‑Free (Non‑Blocking) Algorithms and Their Implementation in Java

Code Ape Tech Column

May 17, 2022 · Fundamentals

Understanding Compare‑And‑Swap (CAS), Its Mechanisms, and Common Pitfalls

This article explains the fundamentals of the compare‑and‑swap (CAS) atomic primitive, how CPUs guarantee its atomicity through bus and cache locking, illustrates a Java spin‑lock implementation using CAS, and discusses typical issues such as single‑variable limitation, long spin times, and the ABA problem with mitigation strategies.

ABA problemCASJava

0 likes · 9 min read

Understanding Compare‑And‑Swap (CAS), Its Mechanisms, and Common Pitfalls

Tencent Cloud Developer

Mar 30, 2022 · Backend Development

Go High-Performance Programming: Concurrency Optimization Techniques

This article, the second in a Go high‑performance series, details concurrency optimizations including lock‑free data structures versus locked lists, sharding and RWMutex to cut lock contention, controlling goroutine creation with pooling, using sync.Once for cheap one‑time initialization, and employing sync.Cond for efficient goroutine notification.

GoOptimizationbenchmark

0 likes · 30 min read

Go High-Performance Programming: Concurrency Optimization Techniques

Baidu Intelligent Testing

Jul 27, 2021 · Backend Development

Comprehensive Guide to Concurrency Optimization in Modern CPUs and Multithreaded Programming

This article systematically explores concurrency optimization for high‑performance C++ engineering, covering CPU trends, SIMD and out‑of‑order execution, single‑thread parallelism, lock‑free and wait‑free synchronization, and practical case studies of counters and queues to improve multithreaded scalability.

CPU architectureSIMDconcurrency

0 likes · 35 min read

Comprehensive Guide to Concurrency Optimization in Modern CPUs and Multithreaded Programming

Baidu Geek Talk

Jun 16, 2021 · Fundamentals

Concurrent Optimization Techniques in C++: SIMD, Out‑of‑Order Execution, and Lock‑Free/Wait‑Free Algorithms

The article reviews Baidu C++ engineers' concurrency optimizations, explaining why modern software must exploit parallelism and detailing SIMD vectorization, out‑of‑order execution, and micro‑architectural analysis, then compares mutex, lock‑free, and wait‑free synchronization, showcasing case studies where atomic and wait‑free designs dramatically improve multithreaded performance.

C++SIMDconcurrency

0 likes · 35 min read

Concurrent Optimization Techniques in C++: SIMD, Out‑of‑Order Execution, and Lock‑Free/Wait‑Free Algorithms

Top Architect

Apr 6, 2021 · Backend Development

Why ConcurrentHashMap.get() in Java 8 Is Lock‑Free

The article explains how Java 8's ConcurrentHashMap implements a lock‑free get() operation by replacing the Segment design with Node objects, using volatile fields and CAS, and how the volatile‑marked table array ensures visibility during resizing, making reads both safe and efficient.

ConcurrentHashMapJavabackend development

0 likes · 10 min read

Why ConcurrentHashMap.get() in Java 8 Is Lock‑Free

Top Architect

Mar 11, 2021 · Fundamentals

Why ConcurrentHashMap.get() in Java 8 Is Lock‑Free

This article explains how Java 8's ConcurrentHashMap implements the get operation without acquiring locks by using volatile fields, CAS, and a simplified node structure, contrasting it with the segment‑based design of JDK 1.7 and detailing the memory‑visibility guarantees provided by volatile.

ConcurrentHashMapJDK8Java

0 likes · 9 min read

Full-Stack Internet Architecture

Sep 22, 2020 · Backend Development

Understanding AtomicInteger, CAS, and Lock‑Free Concurrency in Java

This article explains how Java's AtomicInteger and related atomic classes provide lock‑free thread‑safe operations to replace non‑atomic constructs like i++, detailing their inheritance, underlying Unsafe mechanisms, CAS implementation, memory barriers, optimistic locking, the ABA problem, and practical code examples for increment, decrement, and custom CAS‑based locks.

AtomicIntegerCASJava

0 likes · 15 min read

Understanding AtomicInteger, CAS, and Lock‑Free Concurrency in Java