https://github.com/patrickshaw/scheduling-simulator

A simple proccess scheduling algorithm simulator. Can be used to calculate the completion times of various process scheduling algorithms.
https://github.com/patrickshaw/scheduling-simulator

assignment practice python schedule-simulator simulation study university

Last synced: about 1 month ago
JSON representation

A simple proccess scheduling algorithm simulator. Can be used to calculate the completion times of various process scheduling algorithms.

• Host: GitHub
• URL: https://github.com/patrickshaw/scheduling-simulator
• Owner: PatrickShaw
• License: mit
• Created: 2017-04-22T11:23:24.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-04-22T13:03:03.000Z (over 7 years ago)
• Last Synced: 2024-04-14T12:46:38.272Z (9 months ago)
• Topics: assignment, practice, python, schedule-simulator, simulation, study, university
• Language: Python
• Homepage:
• Size: 2.4 MB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Process simulator

## FIT2070 Operating Systems Assignment 3

### Installation and running Python tasks

1. Open the *26898187_A3* folder.

2. Open a terminal in the folder, or change into the folder from a previously created terminal.

3. Run the command `python3 `**``**` ./processes.txt` where **``** the desired assignment task to be run.

4. The specified task should now run and begin outputting the information for the specific program.

**Note:** It is important that you run the program with Python 3 and not Python 2.

#### Extra options

There are two options available that may be added onto the end of the previously stated command:

    - `-i` immediately outputs process information to the console.

    - `-d` prints debugging information output to the console

### Example execution 1

![Example execution 1](doc/images/example_execution_1.jpg)

The information of each process is printed out in the order that they finish and finally the average waiting time, turnaround time and throughput are printed at the end.

### Example execution 2

![Example execution 2](doc/images/example_execution_2.jpg)

Note that the inclusion of `-d` provides extra information during the execution of the simulation. This may help with checking the correctness of each scheduler algorithm.

### Summary of source code structure and style

#### Important files

- *task_1.py*, *task_2.py* and *task_3.py* contain the scripts to be run to output the process information as specified in the Assignment 3 specification.

- The *./scheduler* directory contains all data pertaining to the scheduler and simulation logic.

- ***fcfs_scheduler.py*:** Specifies the First Come First Served scheduler algorithm.

- ***round_robin.scheduler.py*:** Specifies the Round Robin scheduler algorithm.

- ***srt_scheduler.py*:** Specifies the Shortest Remaining Time scheduler algorithm.

#### Coding style and architecture

The code base makes use of Sphinx Python doc strings; the feature can be utilised to its fullest with many popular IDEs such as PyCharm.

- The observer pattern, supplemented with functional programming (namely, lambda functions), is implemented in the scheduler and process in order to easily modularise what is outputted to the console.

- All schedulers make use of inheritance from a base abstract Scheduler class for easy reuse of code.