java programmer for operating system project

The project is to design, code and simulate a CPU scheduler utilizing round-robin algorithm on a system comprising one ready queue and two cores. The process can utilize any of the available cores , and if the quantum time is insufficient to complete the process task, then process will return back to the ready queue. Otherwise, the process will terminate. The goal of the project is to determine a suitable ready queue size out of the following sizes (2, 4, 8, 16, 32, 64, 128, 256, 512, 1024) , where the decision should be based on the following parameters: average turnaround time, average waiting time, average response time and average number of context switches . The program should read from a file the number of processes, and a list comprising each process ID and its CPU burst time. Assume the arrival time of all processes is 0. Run the program several times and give it a different queue size each time. The program should display the Gantt chart of the processes and print the average turnaround time, average waiting time, average response time and average number of context switches. The time quantum for round-robin is selected based on the process burst time. That is, run the program with queue size = 2 and time quantum = minimum burst time. Then, run the program with queue size = 2 and time quantum = maximum burst time. Then, run the program with queue size = 2 and time quantum = average burst time. Again, run the program with queue size = 4 and time quantum = minimum burst time. Then, run the program with queue size = 4 and time quantum = maximum burst time. Then, run the program with queue size = 4 and time quantum = averageburst time. 1. Think of the problem and try to understand requirements and constraints by asking questions to the instructor and TA. Write a report stating your proposed design to the problem (including problem statement, problem formulation, data structure, algorithm, flow chart) by Thursday March 24, 2016. You must upload a soft copy to ocs, and hand in a printed copy to the TA. 2. Team presentation and demonstration are due on the week of April 10-14, 2016. The presentation should focus on the implementation and experimental results only, and all team’s members should participate in the presentation. 3. The Final report is due on Monday May 2, [login to view URL] report format should include: introduction, problem description and formulation, algorithm description, experimental results, conclusion (comparison between different queue sizes in terms of advantages and disadvantages), references, and program with comments. You need to use C++ or java.