Scribd Logo
Upload

Welcome to Scribd!

  • Sistem Operasi: "CPU Scheduling"

    Uploaded by

    Bernadus Virgiawan
    7 views3 pages
    The document summarizes CPU scheduling algorithms including First Come First Served (FCFS), Shortest Job First (SJF), Shortest-Remaining-Time-First (SRTF), and Round Robin (RR). It provides an example with 5 processes (P1-P5) of varying burst times and arrival times. For each algorithm, it calculates the waiting time and average waiting time.

    Original Description:

    CPU Scheduling on Operation System

    Original Title

    CPU Scheduling

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes CPU scheduling algorithms including First Come First Served (FCFS), Shortest Job First (SJF), Shortest-Remaining-Time-First (SRTF), and Round Robin (RR). It provides an example with 5 processes (P1-P5) of varying burst times and arrival times. For each algorithm, it calculates the waiting time and average waiting time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views3 pages

    Sistem Operasi: "CPU Scheduling"

    Uploaded by

    Bernadus Virgiawan
    The document summarizes CPU scheduling algorithms including First Come First Served (FCFS), Shortest Job First (SJF), Shortest-Remaining-Time-First (SRTF), and Round Robin (RR). It provides an example with 5 processes (P1-P5) of varying burst times and arrival times. For each algorithm, it calculates the waiting time and average waiting time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    SISTEM OPERASI

    “CPU Scheduling”

    Disusun oleh :
    B Virgaiwan Chandra Kusuma
    185314013

    PROGRAM STUDI INFORMATIKA


    FAKULTAS SAINS DAN TEKNOLOGI
    UNIVERSITAS SANATA DHARMA
    YOGYAKARTA
    2020
    1. Terdapat beberapa Proses di dalam antrian ready dengan kebutuhan Burst Time CPU
    sebagai berikut :
    Proses ID Burst Time Time Arrival
    P1 2 2
    P2 1 3
    P3 8 1
    P4 4 4
    P5 5 5

    a. First Come First Served

    Waiting time : Average Waiting Time :


    i. P1 : 0 (0 + 2 + 3 + 11 + 15 ) / 5 = 10,3
    ii. P2 : 2
    iii. P3 : 3
    iv. P4 : 11
    v. P5 : 15

    b. Shortest Job First

    Waiting time : Average Waiting Time :


    i. P1 : 0 (0 + 1 + 3 + 7 + 12 ) / 5 = 4,6
    ii. P2 : 1
    iii. P3 : 3
    iv. P4 : 7
    v. P5 : 12

    c. Shortest-Remaining-Time-First
    d. Round Robin dengan time quantum = 3

    You might also like