Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> Since that time, context switching changed from a O(log(n)) operation to an O(1) one.

I'm not sure how that's relevant here, if for example something takes 1ms and I do it 1000 times a second, I'm using 1000 ms of CPU time vs not doing it at all. So if you want to use big o notation in this context it should be O(n) where n is the number of context switches, because you are not comparing algorithms used to switch between threads but you are comparing doing context switch or not doing it at all.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: