5/30/2010 02:20:00 AM
akbarcyber
| Proses | Arrival time | Bust time (ms) | Kapasitas | Prioritas |
| P1 | 0 | 10 | 150 KB | 3 |
| P2 | 2 | 4 | 50 KB | 1 |
| P3 | 4 | 9 | 51.200 Byte | 1 |
| P4 | 5 | 13 | 100 KB | 2 |
a. SRF
Gant Chart
| P1 | P2 | P1 | P4 | P3 |
0 2 6 14 23 36
| Proses | Waiting Time (ms) |
| P1 | 0+(6-2) = 4 |
| P2 | 2-2=0 |
| P3 | 23-4=19 |
| P4 | 14-5=9 |
AW T = (4 + 0 + 19 + 9) / 2 = 8 ms
- Priority Scheduling
Gant Chart
| P2 | P3 | P4 | P1 |
0 4 13 26 36
| Proses | Waiting Time (ms) |
| P1 | 26 |
| P2 | 0 |
| P3 | 4 |
| P4 | 13 |
AWT = (26 + 0 + 4 + 13 ) / 4 = 10.75 ms
c. Jadi di anatar keduanya yang menurut saya merupakan metode paling simple adalah metode SRF (Short Remaining First) karena memiliki waktu menunggu rata-rata (AWT) lebih kecil di bandingkan dengan metode Priority Scheduling.
Posted in 
No Response to "Tugas Penjadwalan SO"
Posting Komentar