Courses/CS 461/Winter 2006/Nghia Phan/Nghia Phan/Week 9
From CSWiki
Contents |
[edit] CPU Scheduling Simulator
[edit] Introduction
In order to make the computer more productive in multiprogramming, the operating system needs to switch the CPU among processes. It must provides the basic algorithm to determine which process is allowed to get the CPU at the current time, and whether that process is allowed to finish its execution comparing to other processes in the system. Therefore, CPU scheduling algorithms such as First Come First Served (FCFS), Shortest Job First (SJF), Shortest Remaining Job (SRJ), Round-Robin (RR), and Priority are among possible solutions for multiprogrammed operating system. Students in operating system class should be familiar with these algorithms and be able to analyze these algorithms. Usually, students manually compute the waiting times and turnaround times of these algorithms to compare their performances. Consequently, the computation is inefficient and prone to error.
[edit] Goals and Objective
The CPU Scheduling Simulator is an automation that provides efficient and errorless computation of waiting times and turnaround times of First Come First Serve, Shortest Job First, Shortest Remaining Job, Round Robin, and Priority. The system provides the students a clean and convenient way to test their given data or do the analysis of the CPU scheduling algorithms mentioned above.
[edit] Source Code
[edit] Documentation and User Manual
[edit] Screen Shot
