Suppose that the following processes arrive for exevution at the timesindicated. Each process will run the listed amount of time. In answering the questions, use nonpreemptive scheduling, and base all decisions on the information that you have at the time the decision must be made.
|
Process |
Arrival Time |
Bust Time |
|
P1 |
0.0 |
8 |
|
P2 |
0.4 |
4 |
|
P3 |
1.0 |
1 |
a. What is average turnaround time for these processes with the FCFS scheduling algorithm?
solution
total time = p1(8)+p2(12-0.4)+p3(13-1) = 31.6
average time = 31.6/3 = 10.53
b. What is the average turnaround time for these processes with the SJF scheduling algorithm?
solution
total time = p1(8)+p3(9-1)+p2(13-0.4) = 28.6
average time = 28/3 = 9.53
'OS' 카테고리의 다른 글
| file 내용 지우기 (0) | 2008/10/26 |
|---|---|
| 윈도우 기본 프로세스 (0) | 2008/08/19 |
| msinet.ocx 오류 해결. (0) | 2008/08/15 |
| vb6ko.dll 오류 해결 (0) | 2008/08/15 |
| FCFS, SJF, RR(Round-Robin) scheduling 문제로 풀어보기 (0) | 2008/03/23 |
| FCFS, SJF scheduling 문제로 풀어보기 (0) | 2008/03/18 |
댓글을 달아 주세요