This lab explores two proportional share scheduling implementations. In particular, it includes a lottery scheduler and a weighted fair queueing scheduler.
Provide correct implementations for the schedule_lottery and schedule_wfq functions.
Your code can be compiled and tested via simulation by running:
make test
The goal of the scheduler is allocate runtime to threads proportional to their weights. Threads in test the harness have the following properties:
- Threads have weights, but they have no deadlines or priorities that might be found in real-time systems
- All threads start as runnable
- After running, a thread has a 1% probability of moving to the
WAITINGstate for exactly 1 tick