[전남대]운영체제과제 Homework #5

목차

1. A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given processes to be scheduled on one processor, how many different schedules are possible? Give a formula in terms of n
2. Explain the difference between preemptive and nonpreemptive scheduling
3. What advantage is there in having different time-quantum sizes at different levels of a multilevel queueing system?
4. Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use nonpreemptive scheduling, and base all decisions on the information you have at the time the decision must be made.
5. Consider the following set of processes, with the length of the CPU burst given in milliseconds:
6. Distinguish between PCS and SCS scheduling.
7. Explain the differences in how much the following scheduling algorithms discriminate in faver of short processes

본문내용

1. A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given processes to be scheduled on one processor, how many different schedules are possible? Give a formula in terms of n

n!개이다. 예를 들어 A,B,C 라는 프로세스를 스케줄링한다면 ABC BAC CAB ACB BCA CBA 총 6가지(3!개)이다.

2. Explain the difference between preemptive and nonpreemptive scheduling
선점 방식 : 실행중인 프로세스에게 인터럽트를 걸어 현재하고 있는 일을 PCB에 저장하고 다른 프로세스를 할당하는 방식
비 선점 방식 : 현재하고 있는 일을 끝낼 때까지 다른 프로세스가 인터럽트를 못 걸게 하는 방식

참고 자료

없음