The simulator will need to accept the following inputs for each process: Process Name, Arrival Time, and Service Time.
computer science
Description
Instructions:
Create a simulator in C1 that simulates First-Come-First Serve (FCFC), Shortest Process Next (SPN), and ShortestRemaining Time (SRT).
• The simulator will need to accept the following inputs for each process: Process Name, Arrival Time, and Service Time.
• The simulator would need to calculate and display the following outputs (in a table) for each process: Process Name, Arrival Time, Service Time, Start Time, Finish Time, Wait Time, Turnaround Time.
• Similar to the examples we did in the lecture, you can ignore I/O i.e. in non-preemptive algorithms, the processes run straight through to the end once started.
