- Your Task Is To Develop A Simulation Of A Dispatcher Scheduler That Assigns Processes Or Jobs To A Set Of Available Pr 1 (94.04 KiB) Viewed 42 times
Your task is to develop a simulation of a dispatcher/scheduler that assigns processes (or jobs) to a set of available processors or processing nodes. Assume that your computing infrastructure has 5 processors available. Processors are identified as PA, PB.... Now consider n-200 processes with different runtime requirements. Specifically, each process has associated with it a burst time (processing time) and a memory requirement. Burst-times are assigned at random (10.10⁰ cycles - 50 - 10¹2 cycles). Memory requirements are assigned at random (0.25 MB - 8GB). Select random arrival times from 1s to 48hours for each of the processes. For questions 1-3, you may assume that the set of 200 processes is known a-priori; Hence, you will need to develop a function that can generate this set with random burst- times and memory requirements. We can assume that once a process has been dispatched to a specific processor, it will remain with this processor and once started it will run to completion, i.e., there is no preemption. This means that the burst time is the total execution time. 1. Suppose that all 5 processors are identical (i.e., same speed and memory), develop and implement a scheduling algorithm that assigns the set of 200 processes to the 5 processors such that the total turnaround time to complete all 200 processes is minimized. Can you find the best assignment? How close does your scheduler approximate the best assignment? Rectangular Snip 2. In order to execute a process on a specific processor, sufficient memory has to be available. Assume that the processing nodes are identical in speed but have the following memory availability: PA PB-2GB, Pc-PD-4GB, and PE - 8GB. Modify your scheduling algorithm from Q1 to assign the processes to the corresponding processors. Show how well your algorithm minimizes the turnaround time of the set of 200 processes. 3. Modify your scheduling algorithm developed in Q1 and Q2 and show the best assignment of processes if the processors are identical, i.e., 8GB memory available but they differ in speed. Specifically: PA-PB-2GHz, Pc-Pp-3GHz and Pe=5GHz. 4. Last, but not least, develop a scheduling methodology that can deal with the sequential arrival of the 200 processes. That is, the scheduler cannot inspect the entire set of processes but must schedule them one by one in the order that they arrive. What is the best turnaround time that you can achieve? NOTE: You do not need to generate actual processes. You only work with the set of synthetic processes. The effect of "running" a process is to advance the simulated clock by the burst time. You control the order in which the processes start and finish.