OS XV6 Schudelar
Budget: $30 – $250 USD
Implement a first-in first-out (FIFO) scheduler, a last-in first-out (LIFO) scheduler, and a "fair" scheduler that picks the process with the least run time.
Implement your changes in proc.c. Find the existing scheduler_fifo, scheduler_lifo, scheduler_fair functions.
Test your solution in xv6 with: schedtest 12
Run schedtest three times and average the results.
Explain your results:
Which scheduler gives the best turnaround time, and why? Which gives the worst and why? What were the actual numbers?
Which scheduler gives the best response time, and why? Which gives the worst and why? What were the actual numbers?
Why is round-robin (the default scheduler) so similar to the fair scheduler in its results?
Turn in proc.c and your written explanations.
Implement your changes in proc.c. Find the existing scheduler_fifo, scheduler_lifo, scheduler_fair functions.
Test your solution in xv6 with: schedtest 12
Run schedtest three times and average the results.
Explain your results:
Which scheduler gives the best turnaround time, and why? Which gives the worst and why? What were the actual numbers?
Which scheduler gives the best response time, and why? Which gives the worst and why? What were the actual numbers?
Why is round-robin (the default scheduler) so similar to the fair scheduler in its results?
Turn in proc.c and your written explanations.