News for hackers. Stuff that matters.
Re:How Con Kolivas's BFS CPU scheduler works by nailer on Saturday October 17, 2009 @04:13PM (#887366)
> Remember, the single goal of the project is to get worst-case latency for all non-cpu-limited processes on the system as low as it possibly can get. Throughput, and even best- and average case latency are considered entirely expendable.

I've just been listing to lectures from MIT's introduction to algorithms, where more emphasis is placed on worst-case scenarios than otherwise, the reasoning being that these make guarantees possible. So more power to BFS.

There are no comments on this comment yet.