Who invented O(1) scheduler algorithm?
In Abhishek Chatterjee's resume I saw this ...
We are working on the development of an effective CPU
Scheduling Algorithm named as ELRR: Error Limit
Round Robin Scheduling. It is an O (1) Time Complexity
Proportional Share Scheduler. We are concerned with its
design, implementation and evaluation. This is being
implemented in the Linux kernel 2.4.2.
Actually who invented the O(1) algorithm in linux-2.6? Is that based on something like this?
We are working on the development of an effective CPU
Scheduling Algorithm named as ELRR: Error Limit
Round Robin Scheduling. It is an O (1) Time Complexity
Proportional Share Scheduler. We are concerned with its
design, implementation and evaluation. This is being
implemented in the Linux kernel 2.4.2.
Actually who invented the O(1) algorithm in linux-2.6? Is that based on something like this?
