[운영체제][운영체제] 운영체제(operating system con)

소개글

운영체제입니다

목차

1.The Sleepong-Barber Problem. A Barbershop consists of a waiting room with n chairs and the barber room containing the barber chair. If there are no customers to be served, the barber goes to sleep. If a customer enters the barbershop and all chairs are occupied, then the customer leaves the shop. If the barber is busy but chairs are available, then the customer sits in one of the free chairs.

2. Given money partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each of the first-fit, best-fit, worst-fit algorithms place process of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm markes the most efficient use of memory?

3. Consider the two-dimensional array A:
int A[][] = new int [100][100];
where A[0][0] is stored at location 200, in a paged memory system with page of size 200. A small process resides in page 0 (locations 0 to 199) for manipulating the A matrix; thus, every instruction fetch will be from page 0.
For three frames, how many page faults are generated by the following array-initialization loops, using LRU replacement, and assuming page frame 1 has the process in it, and the other two are initially empty:

4. Consider the following page-reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six or seven frames? Remember that allframes are initially empty, so your first unique pages will all cost one fault each.

본문내용

1.The Sleepong-Barber Problem. A Barbershop consists of a waiting room with n chairs and the barber room containing the barber chair. If there are no customers to be served, the barber goes to sleep. If a customer enters the barbershop and all chairs are occupied, then the customer leaves the shop. If the barber is busy but chairs are available, then the customer sits in one of the free chairs.

참고 자료

운영체제