Home CPU Scheduling Disk Scheduling Page Replacement Deadlock


CPU SCHEDULING

What is CPU Scheduling ?


Important Terminologies

  • Burst Time/Execution Time: It is a time required by the process to complete execution. It is also called running time.
  • Arrival Time:when a process enters in a ready state
  • Finish Time:when process complete and exit from a system
  • Multiprogramming:A number of programs which can be present in memory at the same time.
  • Jobs: It is a type of program without any kind of user interaction.
  • User:It is a kind of program having user interaction.
  • Process:It is the reference that is used for both job and user.
  • CPU/IO burst cycleCharacterizes process execution, which alternates between CPU and I/O activity. CPU times are usually shorter than the time of I/O.

Types of CPU Scheduling Algorithms

  • First Come First Serve(FCFS)
  • Shortest Job First (SJF)
  • Longest Job First (LJF)
  • Shortest Remaining Time First (SRTF)
  • Longest Remaining Time First (LRTF)
  • Round Robin
  • Priority (Non Preemptive)
  • Priority (Preemptive)
  • Highest Response Ratio Next (HRRN)
  • Lets try to Run and Understand how these CPU Scheduling Algorithms actually WORK and even make a COMPARITIVE ANALYSIS.