Linux Scheduler(Φροντιστήριο για την 4η σειρά)

kornilak@csd.uoc.gr

Implement Soft & Hard Deadline scheduling algorithm

At each scheduling interval, scheduler kills the processes that their deadline has passed.

If there are processes that their soft deadline has passed but their hard deadline has not, execute the process with the closest hard deadline to current time.

If there are no processes that their soft deadline has passed,choose the next process using round robin scheduling.

For this assignment

● Use your code from assignment 3You will need set_deadlines and get_deadlines system calls

● Use the guidelines from the previous assignment in order to compile Linux Kernel and run it.

Continue from assignment 3

● Create simple programs that initialy set their demand time

● Then, each will spin for some time● Your scheduler should print (using printk)

○ The PID of the task it picked next○ Its expected time, soft and hard deadline

How to test