Please read carefully. This assignment has a lot information and i did the best i could to cut it short. This subject is Data Structure. We are learning about intro to Queues. This is a two-part assignment.

1) Perform a hand simulation (draw a pitcure) of the mfq simulation lab to ensure that you understand the algorithm. Your output should agree with the partial output provided in the lab document. This picture is really important for me to see

2) In this lab you will write a Java program that will simulate an operating system’s job scheduling policy to determine which process will be assigned the CPU when it becomes available. We will utilize a system of queues to simulate a sophisticated job scheduling mechanism, the multi-level feedback queue (MFQ)

Here are materials on what to use for this lab below.

The input to this simulation will consist of job requests, each composed of three elements:

·      Arrival time – Time job is initially submitted to the pattern

·      Process identifier (pid) – Identifies each process as it travels through the system

·      CPU time – CPU time required by the process to complete its job

The output, displayed in a tabular format, should include a table entry each time a job enters the system indicating the:

·      Event

·      System time

·      Processor identifier (pid)

·      CPU time needed

 

Please read carefully. This assignment has a lot information and i did the best i could to cut it short. This subject is Data Structure. We are learning about intro to Queues. This is a two-part assignment.1) Perform a hand simulation (draw a pitcure) of the mfq simulation lab to ensure that you understand the algorithm. Your output should agree with the partial output provided in the lab document. This picture is really important for me to see2) In this lab you will write a Java program that will simulate an operating system’s job scheduling policy to determine which process will be assigned the CPU when it becomes available. We will utilize a system of queues to simulate a sophisticated job scheduling mechanism, the multi-level feedback queue (MFQ)Here are materials on what to use for this lab below.The input to this simulation will consist of job requests, each composed of three elements:∙      Arrival time – Time job is initially submitted to the pattern∙      Process identifier (pid) – Identifies each process as it travels through the system∙      CPU time – CPU time required by the process to complete its jobThe output, displayed in a tabular format, should include a table entry each time a job enters the system indicating the:∙      Event∙      System time∙      Processor identifier (pid)∙      CPU time neededWhen a process a completes and leaves the system, an appropriate table entry should be output to the indicate:∙      Event∙      System time∙      Process identifier (pid)∙      Total time in the system∙      Identify of the lowest- level queue in which the process resided- When the simulation is complete, you should also output the following:∙      Total number of jobs∙      Total time of all jobs in system – sum of the time each job is in the system∙      Average response time – where response time is defines as the interval from the time a processenters the system to the time of first response, or the time it starts running∙      Average turnaround time for the jobs – where turnaround time is defined as the interval from thetime a process enters the system to the time of its completion∙      Average waiting time – where waiting is the amount of time that a process is kept waiting in a queue∙      Average throughout for the system as a whole – the number of jobs divided by the sum of total time of all jobs in the system