1. Consider the below program that shows a parent process using fork() to create a child process. Assume it runs on a Unix system that uses the Copy-on-Write technique and some form of simple paging (The details of how paging is implemented are not important).
2. Describe how exactly the Copy-on-Write technique would be implemented.
3. Give an estimate for how many operations (i.e., trap into kernel, allocate a new frame for the child, copy the contents over, map the child to the new frame) will be required for this program? Describe in details
4.  

Transcribed Image Text:

#include <sys/types.h>< #include <unistd.h>< int global; H void main() {< int i, pid; int local;< pid= fork();< if(pid > 0) < global = 1;4 local = 2;4 }else global = 5; ¹ local = 6;4 #include <sys/types.h>< #include <unistd.h>< int global; H void main() {< int i, pid; int local;< pid= fork();< if(pid > 0) < global = 1;4 local = 2;4 }else global = 5; ¹ local = 6;4

Answer rating: 100% (QA)

CopyonWrite is implemented in the example program When the parent process forksthe operating system creates a new page table for the child processThe childs page table is initially identical to the pa... View the full answer