Skip to content

Conversation

@EAHITechnology
Copy link

In the case that the task trigger time is relatively late, it is possible that the time complexity of traversing a map is O(n), but nothing is actually done, which leads to a waste of CPU time. The time wheel data structure can effectively reduce the order of magnitude of scanning. At the same time, this part of the logic can also be hidden behind the business logic in the internal.go

@cckellogg
Copy link
Contributor

Curious how does this improve or enhance the current implementation? Why would users want to use this over what is currently there? What is the added overhead?

@wolfstudy
Copy link
Member

Thanks @EAHITechnology work for this.

I am a little confused here, why do we need to use the time wheel to handle nack tasks?

@wolfstudy wolfstudy added this to the 0.9.0 milestone Feb 16, 2022
@freeznet freeznet modified the milestones: v0.9.0, v0.10.0 Jul 4, 2022
@RobertIndie RobertIndie modified the milestones: v0.10.0, v0.11.0 Mar 27, 2023
@RobertIndie RobertIndie modified the milestones: v0.11.0, v0.12.0 Jul 4, 2023
@RobertIndie RobertIndie modified the milestones: v0.12.0, v0.13.0 Jan 10, 2024
@RobertIndie RobertIndie modified the milestones: v0.13.0, v0.14.0 Jul 15, 2024
@RobertIndie RobertIndie modified the milestones: v0.14.0, v0.15.0 Oct 8, 2024
@RobertIndie RobertIndie modified the milestones: v0.15.0, v0.16.0 May 15, 2025
@RobertIndie RobertIndie modified the milestones: v0.16.0, v0.17.0 Jul 29, 2025
@RobertIndie RobertIndie modified the milestones: v0.17.0, v0.18.0 Oct 23, 2025
@RobertIndie RobertIndie removed this from the v0.18.0 milestone Dec 1, 2025
@RobertIndie RobertIndie added this to the v0.19.0 milestone Dec 1, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

5 participants