Process scheduling involves allocating resources to different processes efficiently. This project simulates the operation of a process scheduler in a multiprocessor system. It aims to keep the CPU busy as much as possible while minimizing response time and waiting time for processes.
- NEW: A process that has been created but not arrived yet
- RDY: A process that has arrived and moved to the ready queue
- RUN: A process being served by the CPU
- BLK: A process that has requested an I/O operation
- TRM: A process that has finished execution
- First Come First Serve (FCFS): Assigns the CPU to the process that requests it first
- Shortest Job First (SJF): Selects the waiting process with the smallest remaining CPU time
- Round Robin (RR): Assigns a fixed time slice to each process
- Process Migration: Processes may migrate between processors based on certain conditions.
- Work Stealing: Processes from the shortest queue steal processes from the longest queue.
- Killing a Process: A process should be killed if it receives a kill signal.
- Process Forking: A process can fork another process.
- Orphan Process: Child processes of a terminated parent are considered orphaned.
- Processor Overhead: A processor may go out of service due to overhead.
The project calculates various statistics related to process scheduling, including arrival time, response time, CPU time, termination time, turnaround duration, waiting time, processor load, and processor utilization.
- Interactive Mode: Displays output upon pressing the "Enter" key.
- Step-By-Step Mode: Waits one second before displaying output.
- Silent Mode: Produces an output file.
The input file specifies parameters such as the number of processors, time slice for RR, and process details.
- Create the input file.
- Run the program.
- Select the desired mode.
- Check the output.
Include screenshots here.
