Nicholas Gautier | CPU Scheduler Simulator

Description

This is a simulation of various CPU Schedulers. This program was originally assigned during the Operating System Concepts class. With this software, this program will demonstrate various CPU Schedulers. The various CPU algorithms supported in this program are the following:

First Come, First Server (aka FIFO)
Shortest Job First
Priority
Round Robin with Quantum Levels 4 and 8

This simulation demonstrates which algorithm is faster at executing all of the processes in a timely fashion. Because this is a simulation program, you have the flexibility to generate 100 minimum processes or a maximum of 9000 processes in real-time. The data in each process is merely simple integers being reduced in the respected CPU algorithms. As such, we are not truly generating real-world data, but merely inspecting which algorithm is best at processing data in real-time.

Images

The slide show feature will not work correctly without JavaScript!<\br> Please enable javascript for the slide show to work with your browser!

Gallery Controls

ReadMe

    CPU Scheduler Simulation
           README
----------------------


Authors: Nicholas Gautier
E-Mail: Nicholas.Gautier.Tiger@GMail.com


===============================
===============================


Name: CPU Scheduler
Version: 1.0
Released: 21.November.2017
Build Time: About two weeks; time constraint


===============================
===============================


Platform: Desktop\PC
Language: C
Description:
    This is a simulation of various CPU Schedulers.  This program was
        originally assigned during the Operating System Concepts class.
        With this software, this program will demonstrate various
        CPU Schedulers.  The various CPU algorithms supported in this
        program are the following:
            - First Come, First Server (aka FIFO)
            - Shortest Job First
            - Priority
            - Round Robin with Quantum Levels 4 and 8
        This simulation demonstrates which algorithm is faster at
        executing all of the processes in a timely fashion.  Because
        this is a simulation program, you have the flexibility to
        generate 100 minimum processes or a maximum of 9000 processes
        in real-time.  The data in each process is merely simple integers
        being reduced in the respected CPU algorithms.  As such, we are not
        truly generating real-world data, but merely inspecting which
        algorithm is best at processing data in real-time.
Note:
    This project is merely a simulation of various CPU Schedulers and is not
    intended for real-life environments.


===============================
===============================


Requirements:
    Ideally, no special requirements necessary, other than a standardized desktop
    environment -- Windows, GNU/Linux, Mac, whatever should work.


===============================
===============================


License:
    This is a simulation project and was only created for educational
    purposes only.  The source code provided is to only be used for
    educational purposes and non-profit projects.  If using any segments
    from the source code, please provide proper credit to all authors
    mentioned in this readme file.
    
    Source code and all assets included are NOT to be used for commercial
    projects (or products) for monetary gains.  The source code provided
    is to only be used for educational purposes and non-profit means.