Multicore Process Scheduling Simulator

CPU Scheduling

C++

This is an implementation of CPU process scheduling simulator where it explores the various scheduling methods of processes with multicore capability. Specifically, it looks for the performance of

1. First in First out (FIFO): non-preemptive until completion or blocks I/O
2. Longest Running Time First (LRTF): process with longest remaining always gets the CPU. Shorter will be pre-empted if longer proecss becomes executable.
3. Round-Robin: Each assigned timeslice when scheduled. Preempted if not completed and yeeted to the end of queue.

Git Code.