Skip to content

Update README.md #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ankur-anand merged 2 commits into from
Oct 4, 2025
Merged

Update README.md #8

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
058788f
Update README.md
ankur-anand Oct 4, 2025
cbdebee
Update README.md
ankur-anand Oct 4, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,13 +11,13 @@ A high-performance, generic **Hierarchical Timing Wheel** implementation in Go f

When you need to manage thousands or millions or timers (timeouts, TTLs, scheduled tasks) etc. While Go's standard `time.Timer` is excellent, it faces some challenges at high volumes.

## Use Case: Expiring 10 Million Cache Keys Efficiently
### How a Timing Wheel Efficiently Expires 10 Million TTL-Based Cache Keys

Traditional cache cleanup scans every key (`O(n)`), which works fine at small scale — but completely breaks down once you hit **millions** of entries.

Using a **Timing Wheel**, expiration becomes `O(1)` per tick — processing *only* the keys that are actually due right now.

### Read Stall Comparison (10 Million Keys)
#### Read Stall Comparison (10 Million Keys)

|**Metric**|**Naive Scan**|**Timing Wheel**|
|:-|:-|:-|
Expand Down
Loading