Operating System Simulator Essay Example | Topics and Well Written Essays - 1500 words

Operating System Simulator - Essay Example It also supports JRE version 1.2. Java as language offers various capabilities including running the application as a Java applet or as a java application. Therefore, this CPU process-scheduling simulator can be run either as a Java applet or as a Java application. This CPU process scheduling algorithm can be used to perform several experiments on different process scheduling algorithms. Tables of data, graphs, and Gantt charts in form of log files in HTML can be produced by the simulator at the end of each experimental run. One experiment can be carried out involving several processes, for instance, the experiment can be based on eight different CPU processes. The tabular data obtained for different CPU process scheduling algorithms can then be analyzed and important conclusions drawn. Graph or Gantt chart data obtained can also be analyzed. Comparison between the various CPU scheduling algorithms can be drawn and explained based on the analysis of such data and the conclusions arri ved at. The statistic to be evaluated and analyzed from the experimental runs includes data on processes throughput, CPU burst times, I/O Burst times, Waiting times, Turn Around time, and the ratio of CPU Burst Times to Time to Ready plus CPU Burst time. As noted earlier, this CPU process-scheduling simulator supports various CPU scheduling algorithms such as First Come, First Served (FCFS), Shortest Job First (SJF), and the Round Robin algorithm (RR). This simulator manual report will aim at reporting on experiments carried on two CPU process scheduling algorithms; the First Come, First Served (FCFS) algorithm, and the Shortest Job First (SJF) CPU scheduling algorithm. The experiment will be carried out on eight processes for both the algorithms and the characteristics of bot the algorithms evaluated based on those processes. Graphs, Gantt charts, and table data for both the CPU scheduling algorithms will be drawn, analyzed, and evaluated. The evaluation and analysis to be carried out is aimed at illustrating the differences between the two CPU process-scheduling algorithms based on the data obtained. Normally, it is expected that, for the Shortest Job First SJF also referred to as the shortest remaining CPU burst time first, the process with the shortest CPU burst time is the one that is executed first. For the First Come, First Served CPU scheduling algorithm, the first job to arrive in the ready queue is the one that is executed first, and it must be executed to completion before any other process takes up the CPU. However, there are scenarios such when there is an I/O request, a process being executed in the First Come, First Served algorithm is returned to the waiting time and a new process in the queue is executed before the other process continues executing. This is known as context switching and they are normally two. In the Shortest Job First CPU scheduling algorithm, there are scenarios where more than one process with the shortest CPU burst time; m ore than one process have the same CPU burst time exist in the ready queue. In such cases, these processes are evaluated depending on the time each job or process arrived in the ready queue, this implies some sort of First Come, First Served CPU scheduling algorithm is implemented, and the job that arrived in the re