CPU Scheduling Algorithms

CPU Scheduling Algorithms:

A scheduling system allows one process to use the CPU while another is waiting for I/O, thereby making full use of otherwise lost CPU cycles.

Whenever the CPU becomes idle, it is the job of the CPU Scheduler to select another process from the ready queue to run next.

CPU scheduling decisions take place under one of four conditions:
1. When a process switches from the running state to the waiting state.
2. When a process switches from the running state to the ready state.
3. When a process switches from the waiting state to the ready state.
4. When a process terminates.

CPU Scheduling Criteria:

  1. CPU utilization
  2. Throughput
  3. Turnaround time
  4. Waiting time
  5. Response time
CPU Scheduling Algorithms:

1.First-Come First-Serve Scheduling, FCFS

2. Preemptive Shortest-Job-First Scheduling, SJF


3. Non-Preemptive Shortest-Job-First Scheduling, SJF 

4. Priority Scheduling
5. Round Robin Scheduling
Read more...

Operating Systems:

EasyExamNotes.com covered following topics in Operating Systems.
    A list of Video lectures

    Post a Comment

    Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

    Python Programming ↓ 👆
    Java Programming ↓ 👆
    JAVA EasyExamNotes.com covered following topics in these notes.
    JAVA Programs
    Principles of Programming Languages ↓ 👆
    Principles of Programming Languages
    EasyExamNotes.com covered following topics in these notes.

    Practicals:
    Previous years solved papers:
    A list of Video lectures References:
    1. Sebesta,”Concept of programming Language”, Pearson Edu 
    2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
    3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
    4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

      Computer Organization and Architecture ↓ 👆

      Computer Organization and Architecture 

      EasyExamNotes.com covered following topics in these notes.

      1. Structure of desktop computers
      2. Logic gates
      3. Register organization
      4. Bus structure
      5. Addressing modes
      6. Register transfer language
      7. Direct mapping numericals
      8. Register in Assembly Language Programming
      9. Arrays in Assembly Language Programming

      References:

      1. William stalling ,“Computer Architecture and Organization” PHI
      2. Morris Mano , “Computer System Organization ”PHI

      Computer Network ↓ 👆
      Computer Network

      EasyExamNotes.com covered following topics in these notes.
      1. Data Link Layer
      2. Framing
      3. Byte count framing method
      4. Flag bytes with byte stuffing framing method
      5. Flag bits with bit stuffing framing method
      6. Physical layer coding violations framing method
      7. Error control in data link layer
      8. Stop and Wait scheme
      9. Sliding Window Protocol
      10. One bit sliding window protocol
      11. A protocol Using Go-Back-N
      12. Selective repeat protocol
      13. Application layer
      References:
      1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
      2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
      3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
      4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.