/OS-Project_Process-Scheduling-Analyzer

OS Process Scheduling Analyzer project that performs 6 fundamental process scheduling algorithms: First-Come-First-Serve (FCFS), Shortest Job First (SJF), Round Robin, longest job first, lottery ticketing and Priority Scheduling.

Primary LanguageC

Process Scheduling Analyzer

The OS Process Scheduling Analyzer is a comprehensive software tool designed to empower users to assess and compare the performance of fundamental process scheduling algorithms. The supported algorithms include:

  • First-Come-First-Serve (FCFS)
  • Shortest Job First (SJF)
  • Round Robin
  • Longest Job First (LJF)
  • Lottery Ticketing
  • Priority Scheduling

The primary objective is to provide a user-friendly interface for inputting and simulating diverse sets of processes with varying burst times, priorities, and quantum times. By executing these scheduling algorithms and tracking key performance metrics, such as average waiting times, turnaround times, and response times, the tool facilitates in-depth analysis and informed decision-making regarding process scheduling choices.