(Re)implement the BFS scheduler into the FreeBSD

Abstract

Milestones

  1. Simple scheduler with 64 round robin queues. I will also publish simple benchmarking results.
  2. The 64 queues act according to the BFS specification (With necessary modifications to match the FreeBSD design) Static priorities and SCHED_ISO are taken round robin, SCHED_NORMAL and SCHED_IDLEPRIO are taken according to their deadline. (The lookup is O(n)). I will also publish the results of the same benchmark tests as in the previous release point.
  3. Implementing the scalability features to the BFS as specified in the BFS specification. I might also consider adding improvements which are not part of the BFS spec. I will also publish the results of the same benchmark tests as in the previous release points.
  4. Running (implementing) additional benchmarks, analysing results. Finding the cause of possible bad results, bug fixing.

References

Contact

Project blog

SVN repositary

Final report

RudolfTomori/rudotSoC2011 (last edited 2011-08-20 12:19:31 by RudolfTomori)