Just few years back(about 2 years), I was reading about linux 2.6 scheduler, the
O(1) scheduler. For me it seemed the perfect scheduler(I am no kernel expert or developer, but I keep crossing the kernel domain because of my work), since it was O(1). There were no lookups required. I wondered how much it would effect the performance of my application in the O(1) and the earlier schedulers.
But then it seems, there still problems associated with this scheduler too. The issue that is identified is in the complexity and time cost for calculating the priority for task.
As result of this we have a new scheduler called CFS (Completely Fair scheduler) in Linux 2.6.23
Wait.. it seems we can expect another new scheduler very soon.
References:
