[공학]Operation System Concepts chap6, 7(운영체제)

소개글

Operation System Concepts 6장과 7장의 연습문제의 한글 답안입니다.
6장 연습문제 - 1번 2번 3번 4번 5번
7장 연습문제 - 1번 5번 8번
이렇게 답안 작성 되어있습니다.

목차

운영체제 6장 연습문제
운영체제 7장 연습문제

본문내용

6.1 The first known correct software solution to the critical-section problem for two processes was developed by Dekker. The two processes, p0 and p1, share the following variables:

boolean flag[2]; /* initially false */
int turn;

The structure of process Pi (i == 0 or 1) is shown in Figure 6.27; the other process is Pj (j == 1 or 0). Prove that the algorithm satisfies all three reqirements for the critical-section problem.

6.2 Explain why spinlocks are not appropriate for single-processor systems yet are often used in multiprocessor systems.

6.3 Explain why implementing synchronization primitives by disabling interrupts is not appropriate in a single-processor system if the synchronization primitives are to be used in user-level programs.

6.4 Describe how the Swap( ) instruction can be used to provide mutual exclusion that satisfies the bounded-waiting reqirement.

6.5 Servers can be designed to limit the number of open connections For example, a server may wish to have only N socket connections at any point in time. As soon as N connections are made, the server will not accept another incoming connection until an existing connection is released. Explain how semaphores can be used by a server to limit the number of concurrent connections.

7장 연습문제도 답 있음..

참고 자료

Operation System Concepts