Old MathJax webview

Deliverables: 1. Code, Output due 23 Dec 2021 before 11.59pm 2. A maximum of TWO (2) minutes Video presentation of the lab work discussion due 24 Dec 2021 before 11:59pm Video discussion must ONLY focus: 1. Solution Design 2. Tools used for implementation and result analysis Question: Design and implement a solution to a system which consists of 4 tasks namely task T1, T2, T3 and T4 using Rate Monotonic Algorithm on Linux. Your solution must use a real time scheduler, timers, and multi process on Linux. The parameters of the task are given as follows: T1= {2, es} T2= {4, es} T3= {6, es} T4= {8, es} The value of e, to es is left for your own decision but of course they must fulfill the RM sufficient and necessary test (U, SURM). Hint: To execute the jobs in sequence according to the RM algorithm, you will have to use the Linux real time scheduler and set the priority accordingly. To do those, take a look at (use the man pages ) the following system call. System Call Description nice( ) - Set a process's nice value sched_setscheduler() - Set a process's scheduling policy sched_getscheduler() - Get a process's scheduling policy sched_setparam() - Set a process's real-time priority sched_getparam() - Get a process's real-time priority sched_get_priority_max() - Get the maximum real-time priority sched_get_priority_min() - Get the minimum real-time priority sched_rr_get_interval() - Get a process's timeslice value sched_yield() - Temporarily yield the processor. Deliverables: 1. Code, Output due 23 Dec 2021 before 11.59pm 2. A maximum of TWO (2) minutes Video presentation of the lab work discussion due 24 Dec 2021 before 11:59pm Video discussion must ONLY focus: 1. Solution Design 2. Tools used for implementation and result analysis Question: Design and implement a solution to a system which consists of 4 tasks namely task T1, T2, T3 and T4 using Rate Monotonic Algorithm on Linux. Your solution must use a real time scheduler, timers, and multi process on Linux. The parameters of the task are given as follows: T1= {2, es} T2= {4, es} T3= {6, es} T4= {8, es} The value of e, to es is left for your own decision but of course they must fulfill the RM sufficient and necessary test (U, SURM). Hint: To execute the jobs in sequence according to the RM algorithm, you will have to use the Linux real time scheduler and set the priority accordingly. To do those, take a look at (use the man pages ) the following system call. System Call Description nice( ) - Set a process's nice value sched_setscheduler() - Set a process's scheduling policy sched_getscheduler() - Get a process's scheduling policy sched_setparam() - Set a process's real-time priority sched_getparam() - Get a process's real-time priority sched_get_priority_max() - Get the maximum real-time priority sched_get_priority_min() - Get the minimum real-time priority sched_rr_get_interval() - Get a process's timeslice value sched_yield() - Temporarily yield the processor