Details
-
Bug
-
Status: Open
-
Major
-
Resolution: Unresolved
-
None
-
1
Description
Profiling some client application shows that noticeable amout of time is spent in Server::next_timeout() (defined inĀ src/mcserver/mcserver.cc).
It appears that this function searches for request with shortest timeout deadline using a linear complexity algorithm. Eventually changing data structure from a linked list to a heap implemented as a binary tree would allow to implement this function in O(1) complexity.
Thanks for suggestion, JC. I will add this to our backlog.