News for hackers. Stuff that matters.
Re:Sleep Sort by wtracy on Wednesday June 15, 2011 @11:39PM (#2660034)
I just realized: We would need a circuit polling each of the jobs to see when they finish, and I don't see how it could poll all of jobs every clock cycle. So I don't see it being possible to achieve the per-cycle resolution I suggested above.

Furthermore, the polling circuit would have to poll each of the n tasks n times, leading us finally back to a running time of O(n^2).

Still a fun thought experiment, though.

Re:Sleep Sort by FlowerPower on Thursday June 16, 2011 @11:17AM (#2661597)
Why would you poll the tasks? Cant the tasks wake up after their time is done, just fire an interrupt witht he number of the task.