Hacker Times
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
colanderman
on July 7, 2023
|
parent
|
context
|
favorite
| on:
Sleeping through the technical interview (2022)
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...
Consider applying for YC's Fall 2026 batch!
Applications
are open till July 27.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] https://en.wikipedia.org/wiki/Completely_Fair_Scheduler#Algo...