Tagged articles
timing wheel
13 articles · Page 1 of 1
This article explains the limitations of traditional timer solutions, introduces the timing‑wheel concept inspired by clocks, details its core design principles, algorithmic steps, data structures, and a complete Spring Boot implementation, showing how it achieves O(1) scheduling and superior throughput in large‑scale backend systems.
JavaTask Schedulingbackend algorithm
0 likes · 14 min read

This article explains the core principles of timers, compares heap‑based and timing‑wheel algorithms, analyzes Go's built‑in timer implementation versus C#'s approach, and provides practical optimization techniques for high‑concurrency, high‑precision scenarios.
C++GoHeap
0 likes · 10 min read

This article explores multiple in‑memory strategies—using a simple map with timers, per‑driver goroutine management, and especially a Go‑implemented timing wheel—to identify Uber drivers who haven’t reported for ten minutes, comparing their complexities, memory usage, and suitability for large‑scale systems.
GoIn-Memoryheartbeat
0 likes · 12 min read

This article explains how to use a timing wheel to efficiently handle RPC timeout processing, startup timeouts, and heartbeat tasks, reducing thread proliferation and CPU waste by organizing timed tasks into hierarchical time slots.
BackendRPCTimeout
0 likes · 10 min read

This article explains the problems caused by naive timer implementations in high‑concurrency RPC frameworks and introduces the timing‑wheel mechanism, illustrating its principles, multi‑level design, and practical applications such as request timeout, startup timeout, and heartbeat handling.
RPCheartbeattiming wheel
0 likes · 12 min read

This article explains the time‑wheel algorithm, from its basic circular‑buffer principle to simple, round‑based, and hierarchical variants, and shows how Kafka implements a multi‑level timing wheel to achieve efficient, low‑memory delayed task execution.
KafkaTask Schedulingbackend algorithms
0 likes · 13 min read

This article explains Kafka's timing wheel algorithm, detailing its O(1) delay operation design, multi‑layer wheel structure, and how Kafka advances time using a DelayQueue, while comparing it with Netty and other open‑source projects.
BackendKafkadelay queue
0 likes · 11 min read

The article explains how Kafka implements delayed operations using a timing wheel with O(1) insertion and deletion, describes its parameters, multi‑level wheel design for large time spans, and the mechanism of advancing the wheel via DelayQueue and the ExpiredOperationReaper, contrasting it with Netty's approach.
AlgorithmBackenddelay queue
0 likes · 8 min read

Kafka handles many requests that require asynchronous processing or waiting for conditions by attaching a timeout parameter; if the condition isn’t met within the timeout, Kafka returns a timeout response, and it implements this efficiently using a hierarchical Timing Wheel data structure that offers O(1) insertion and fast expiration checks.
BackendKafkaScala
0 likes · 12 min read

The article explains how Kafka handles timeout‑based requests using a Timing Wheel data structure, detailing its design, parameters, operation principles, overflow handling, and providing Scala code examples that illustrate O(1) task insertion compared to traditional O(logN) delay queues.
KafkaScaladata structures
0 likes · 10 min read


JavaEdgeOct 14, 2020 · Backend Development
This article explains the need for high‑performance scheduling in Java, introduces the hashed timing wheel algorithm, and details Dubbo's implementation—including core interfaces, data structures, worker logic, and practical use cases such as retries and heartbeat handling.
BackendDubboHashedWheelTimer
0 likes · 11 min read


JD TechSep 4, 2018 · Backend Development
This article describes the evolution, architectural design, and key implementation details of an order dispatch system for instant‑delivery services, covering problem analysis, delay‑task mechanisms such as database polling, DelayQueue and TimingWheel, and the final solution that combines Redis with a timing‑wheel scheduler and asynchronous processing.
Instant DeliveryKafkadelay queue
0 likes · 11 min read

This article describes the end‑to‑end evolution of a large‑scale order dispatch architecture, covering the shift from simple pool display to algorithmic assignment using data mining, genetic algorithms, timing‑wheel scheduling, and a Redis‑backed implementation to improve delivery efficiency and rider experience.
Instant Deliverybackend architectureorder dispatch
0 likes · 11 min read
