Ex. 1 Page replacement algorithm
In this exercise we consider the WSClock page replacement algorithm with a value of two ticks. The system state is given as follows.
| Page | Time stamp | Present | Referenced | Modified |
| 0 | 6 | 1 | 0 | 1 |
| 1 | 9 | 1 | 1 | 0 |
| 2 | 9 | 1 | 1 | 1 |
| 3 | 7 | 1 | 0 | 0 |
| 4 | 4 | 0 | 0 | 0 |
- Explain the content of the new table entries if a clock interrupt occurs at tick 10.
- Due to a read request to page 4 a page fault occurs at tick 10. Describe the new table entry.
Ex. 2 Minix 3
The goal of this exercise is to understand and implement system calls.
- In which files are:
- the constants with number and name for the system calls?
- the names of the system call routines?
- the prototypes of the system call routines?
- the system calls of type signal coded?
- What problems arise when trying to implement a system call int getchpids(int n, pid_t *childpid) which writes the pids of up to n children of the current process into *childpid?
- Write a sub-system call int getnchpid(int n, pid_t childpid) which retrieves the n-th child process.
- Using the previous sub-system call, implement the original getchpids system call. The returned int value corresponds to the number of pids in *childpid, or -1 on an error.
- Write a short program that demonstrate the previous system calls.
- The above strategy solves the initial problem through the introduction of a sub-system call.
- What are the drawbacks and benefits of this solution?
- Can you think of any alternative approach? If yes, provide basic details, without any implementation.
Ex. 3 Research
Write about a page on the topic of the ext2 filesystem. Do not forget to reference your sources.
Ex. 4 Simple questions
- If a page is shared between two processes, is it possible that the page is read-only for one process and read-write for the other? Why or why not?
- A computer provides each process with 65,536 bytes of address space divided into pages of 4096 bytes. A particular program has a text size of 32,768 bytes, a data size of 16,386 bytes, and a stack size of 15,870 bytes. Will this program fit in the address space? If the page size were 512 bytes, would it fit?
- When both paging and segmentation are being used, first the segment descriptor is found and then the page descriptor. Does the TLB also need a two-levels lookup?

![[Solved] VE482-Homework 7](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip.jpg)

![[Solved] VE482-Lab 7](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip-1200x1200.jpg)
Reviews
There are no reviews yet.