Multiprogramming P = efisiensi waktu tunggu proses CPU IDLE  Pn

Presentasi berjudul: "Multiprogramming P = efisiensi waktu tunggu proses CPU IDLE  Pn"— Transcript presentasi:

1 Multiprogramming P = efisiensi waktu tunggu proses CPU IDLE  Pn
P= I/O wait ……(%) CPU IDLE  Pn Pn = CPU Idle pada saat terdapat n process di memory CPU Idle = Pn n = jumlah process(banyak program)

2 Multiprogramming CPU Busy : tingkat kesibukan prosesor
CPU Busy = 1 - cpu idle = 1 - P n CPU / PROCESS Cpu busy / jml job TABEL CPU UTILIZATION cpu idle , cpu busy, cpu/process CONTOH SOAL!!

3 Contoh soal Diketahui data proses sbb: Job (n) Arrival Time CPU Time 1
10.00 5 2 10.07 3 10.15 4 10.17 Jika I/O Wait 80% maka buatlah : Table CPU Utilization ! Grafik proses !

4 Table CPU Utilization Job 1 2 3 4 CPU Idle ( P n ) CPU Busy ( 1- P n )
CPU/Process ( cpu busy/job )

5 Table CPU Utilization Job 1 2 3 4 CPU Idle ( P n ) 0.8 0.64 0.51 0.41
CPU Busy ( 1- P n ) 0.20 0.36 0.49 0.59 CPU/Process ( cpu busy/job ) 0.18 0.16 0.15

6 Grafik proses 1 2 3 4 00 Job Time

7 Job Arrival Time CPU Time 1 10.00 5 2 10.07 3 10.15 4 10.17

8 grafik proses     Job 10.00  1 job 0.2 . 7 = 1.4 10.07  2 job
3 4 00 07 12.5 15 17 27.9 29.3 32.5 0.36 0.5 1.4 0.26 1.74 0.64 Job Time     x1 x2 x3 x4  1 job = 1.4  2 job x1 = 1 x1 = 5.5  1 job = 0.5  2 job = 0.36  3 job x2 = 1.74 x2 = 10.9  2 job x3 = 0.26 x3 = 1.4  1 job 0.2 . x4 = 0.64 x4 = 3.2