News for hackers. Stuff that matters.
Re:Sleeping Through the Technical Interview (2022) by colanderman on Friday July 07, 2023 @03:58PM (#36637515)
Linux's CFS is O(log N) to insert; O(1) to switch tasks (N being number of threads). [1] So O(N log N) it seems.

[1] https://en.wikipedia.org/wiki/Completely_Fair_Scheduler#Algo...

There are no comments on this comment yet.