Your task is to develop a simulation of different scheduling disciplines that allocate a set of processes to available processors. Using the process generator that you developed in Homework 2, generate a set of 50 processes with different runtime requirem

Your task is to develop a simulation of different scheduling disciplines that allocate a set of processes to available processors. Using the process generator that you developed in Homework 2, generate a set of 50 processes with different runtime requirements (i.e., cycles). You may assume that the processes arrive in the system every 50 cycles (e.g., at times 0, 50,100, 150, 200, …etc.) 1. Develop a simulation of Round-Robin Scheduling with a quantum of 50 cycles, and schedule your set of processes. Assuming a context switch penalty of 10 cycles (for the scheduler to switch between processes), compute the average waiting time and the total penalty for the set of processes. Repeat the experiment over different sets of processes. You should document (graphically) the distribution of cycle times for your set of processes. 2. Repeat the experiment above for 2 additional scheduling disciplines (SRT, SJF, LRT-Latest Release Time or reverse EDF). 3. Assuming that you have a multi-processor system with 4 processors. Repeat the above experiments and calculate the average waiting time and total context-switch penalty. NOTE: To analyze the performance of your scheduling strategies, you must conduct multiple experiments over different sets of processes (with different process characteristics). Deliverables: Write a report (about 5 pages) that highlights the performance and differences of the scheduling algorithms. You must discuss all the limitations and assumptions. In detail, show how you analyze the performance (i.e., average waiting time) and present your results. You must submit well-documented code along with specification of any special compilation procedures. homework 2 is here:  Write a program in C or C++, which simulates the generation of a set of k processes. Each process is represented by a 3-tupel, containing • A unique process ID, • The number of cycles required to complete the process, and • The size of the memory footprint. The required number of cycles is chosen from the interval <1,000, 11,000> with a mean of 6,000. While it is acceptable to distribute the required cycles uniformly, I suggest that you attempt to implement a different distribution. 2 The memory footprints of processes fall in the range of 1KB to 100KB with a mean memory footprint of 20KB. You need to represent the set of k processes with a data structure of your choice. Show how the values (required cycles and memory footprint) are distributed over your set of processes. You must submit your program, a short description of your approach and the data structures used, and the analysis of the value distribution