EIS assignment
Problem 1:
Write a program which will create n process. show that the processes will run asynchronously on CPU (i.e. there is no specific order in which the process are scheduled on the CPU).
Problem 2:
Demonstrate the Creation of a Zombie process and also show that the zombie process can be prevented.
A) Zombie process created:
B) Zombie process is prevented:
Problem 3:
Write a program which creates, say 10 process. Let them run in an infinite loop. show that the processes are scheduled on the CPU in no specific order.
Problem 4:
Show that a user level thread blocks the entire process when it calls a blocking system call.
Problem 5:
Give a solution to the bounded buffer producer and consumer problem using semaphore. The buffer should implement in a shared memory. Producer and consumer should be two distinct processes. The buffer state at different times should be captured in a text file or in a graphical representation.
Problem 6:
Create two shared libraries A.so (contains the function definition of factorial) and B.so (containing the function ifprime). Link these libraries dynamically to your executable where factorial and ifprime function is used and demonstrate that a shared library is loaded into memory only when dlopen is called and offloaded from memory when dlclose called for that library. Also, do the same as above creating archives libraries A.a and B.a. Show that the size of executable in this case more than the size of executable in the earlier case.
A) Dynamically linked the libraries (.so) to the main program:
B) Built executable using the archive libraries (.a) made from individual libraries:
Problem 7:
A) Create a pipe between a parent and its child and send data down the pipe. With proper example.
B) Create two pipes before the fork, to implement interprocess communication between parent and child.
C) Implement an IPC (or two half-duplex pipes), such that the coprocess add2 is invoked when two numbers are read from standard input and the value from the co-process is written to its standard output.
Problem 8:
A.1) The Producer/Consumer Problem.
A.2) Barber customer problem.
B) Readers/Writers Problem using Semaphore /Monitors.
C) Dining Philosophers Problem using semaphores/monitors.
D) Dekker’s algorithm / Peterson’s algorithm.
