COMP2240-Assignment Program that Simulates FCFS, SPN, PP and PRR Solved

Write a program that simulates First Come First Serve (FCFS), Shortest Process Next (SPN), Preemptive Priority (PP) and Priority Round Robin (PRR) scheduling algorithms. For each algorithm, the program should list the order and time of the jobs being loaded in the CPU and compute waiting time and turnaround time for every job as well as the average waiting time and average turnaround time.  

 

The average values should be consolidated in a table for easy comparison (check the sample outputs).  

 

Two sample input data sets and the corresponding outputs have been supplied. Additional datasets will be used to test your program. The format of the input data will be the same as in the supplied sample files.

 

Each input data set contains the following information (check the sample input files for exact format):  

1.      Time for running the dispatcher (DISP) which can be zero or more

2.      For each process: process id (ID) , arrival time (Arrive), service time (ExecSize) and process priority

(Priority)

a.      Each process will have a priority from {0, 1, 2, 3, 4, 5} where 0 is the highest priority and 5 is the lowest priority.  

b.      It can be assumed that process P_i will always arrive before or at the same time of process

P_(i+1)

 

Dispatcher: It is assumed that the dispatcher runs to select the next process to run. The dispatcher should behave as follows:  

(i)     The time to run the dispatcher (context switching time) is fixed and taken as input (DISP) from the input file. No other time is wasted in switching between processes other than this.

(ii)   If there is only one process running in the processor and no other process is waiting in the ready queue then there is no need to switch the process and the dispatcher will NOT run.  For example, in PRR scheduling if process P1 is running in the CPU and no other process is waiting in the ready queue then P1 will continue after its time quantum expires – no need to interrupt P1 to send it to ready queue after its time quantum expires then run the dispatcher to reload P1 from the ready queue.  

(iii) If the dispatcher starts at t1 and finishes at t2 (i.e. time to run the dispatcher is t2-t1) then in that run it will choose from the processes that have arrived at or before t1. It will not consider any process that arrives after t1 for dispatching in that run.

(iv)  If a process P1 is interrupted at t1 and another process P2 arrives at the same time t1 then the newly arrived process P2 is added in the ready queue first and the interrupted process P1 is added after that.  

(v)   If two processes Px and Py have all other properties same (e.g. arrival time, priority etc.) then the tie between them is broken using their ID i.e. Px will be chosen before Py if x<y.

 

Some details about the scheduling algorithms are as follows:

 

FCFS: Standard FCFS scheduling algorithm. Process priority is ignored in scheduling.

SPN: Standard SPN scheduling algorithm. Process priority is ignored in scheduling.

PP: Standard preemptive priority scheduling algorithm.

PRR: This is a variant of the standard Round Robin (RR) algorithm. Processes are divided into two priority classes Higher Priority Class (HPC): processes with priority 0, 1 or 2 and Lower Priority Class (LPC): processes with priority 3, 4 or 5. PRR algorithm is exactly same as the standard RR algorithm except each HPC process receives a time quantum of 4 units and each LPC process receives a time quantum of 2 units.   

 

 

 

 

 

In addition to the above simulations, you are to implement a RR scheduling simulation for a dual processor system. Assume that two processors share the same ready queue and the time quantum for processor 1 is 2 milliseconds and for processor 2 is 3 milliseconds, and that the system starts loading processes from processor 1. For dispatching a

process, the dispatcher will run on the processor that is idle. If both processors are idle at the same time and there are jobs in the ready queue then at first the dispatcher will run on processor 1 and then it will run on processor 2 to dispatch processes for them respectively. Output the same data as required for the other simulations. Additionally you will need to specify in which processor a job is assigned at a specific time [i.e. instead of  T1: p1(0) use            P1-T1: p1(0) to clarify that the process 1 (p1) is running in processor 1 (P1) starting at time 1 (T1)].

 

Programming Language: 

The programming language is Java, versioned as per the University Lab Environment (currently a subversion of Java 1.8). You may only use standard Java libraries as part of your submission.

 

User Interface: 

The output should be printed to the console, and strictly following the output samples given in the assignment package. While there are no marks allocated specifically for the Output Format, there will be a deduction when the result format varies from those provided.

 

Input and Output: 

Your program will accept data from an input file of name specified as a command line argument. The sample files datafile1.txt and datafile2.txt (containing the set1 and set2 data) are provided to demonstrate the required input file format.  

 

Your submission will be tested with the above data and will also be tested with other input files.

 

Your program should output to standard output (this means output to the Console). Output should be strictly in the order FCFS, SPN, PP, PRR, Summary.  

 

The sample files datafile1_output.txt and datafile2_output.txt (containing output for datafile1.txt and datafile2.txt respectively) are provided to demonstrate the required output (and input) format which must be strictly maintained. If output is not generated in the required format then your program will be considered incorrect.

 

Two Gantt’s charts are provided to explain the corresponding behaviour of different algorithms and the dispatcher for the two sample data files.