Multilevel Queue Scheduling

A program to simulate a multilevel queue scheduling algorithm with 4 queues. Each queue must be assigned a priority, with q0 having the highest priority and q3 having the lowest priority.

The following scheduling algorithms are used for each queue:

    ● q0 - Round Robin (RR)
    ● q1 - Shortest Job First (SJF)
    ● q2 - Shortest Job First (SJF)
    ● q3 - First-In-First-Out (FIFO)

Each queue should be given a time quantum of 20 seconds, and the CPU should switch between queues after every 20 seconds. The user should be prompted to enter the number of processes along with their priority associated with each queue.

Execute

The theory of the application

Run the below codes in your terminal

cd path_to_your_folder

python init.py

Test runs

python test.py pool_1

In above code pool_1 can be replaced with pool_2 or pool_3.
To test with other process data, create <<pool_name>>.json files with process data in tests folder and execute them with a the file name as an argument.

Step by step time processed application

Run the below codes in your terminal

cd path_to_your_folder/steps

python init.py

Test runs

python test.py pool_1

In above code pool_1 can be replaced with pool_2 or pool_3.
To test with other process data, create <<pool_name>>.json files with process data in tests folder and execute them with a the file name as an argument.