COMP 3000 Essay 1 2010 Question 5: Difference between revisions
No edit summary |
|||
| Line 7: | Line 7: | ||
=Resources= | =Resources= | ||
I found some resources, which might be useful to answer this question | I found some resources, which might be useful to answer this question. As far as I know, FreeBSD uses a Multilevel feeback queue and Linux uses in the current version the completly fair scheduler. | ||
<br /> | <br /> | ||
-Some text about FreeBSD-scheduling http://www.informit.com/articles/article.aspx?p=366888&seqNum=4 | -Some text about FreeBSD-scheduling http://www.informit.com/articles/article.aspx?p=366888&seqNum=4 | ||
Revision as of 18:37, 2 October 2010
Question
Compare and contrast the evolution of the default BSD/FreeBSD and Linux schedulers.
Answer
Resources
I found some resources, which might be useful to answer this question. As far as I know, FreeBSD uses a Multilevel feeback queue and Linux uses in the current version the completly fair scheduler.
-Some text about FreeBSD-scheduling http://www.informit.com/articles/article.aspx?p=366888&seqNum=4
-ULE Thread Scheduler: http://www.scribd.com/doc/3299978/ULE-Thread-Scheduler-for-FreeBSD
-Completly Fair Scheduler: http://people.redhat.com/mingo/cfs-scheduler/sched-design-CFS.txt
-Sebastian