CS703 Assignment 1 Solution and Discussion

[zareen]

CS703 – Advanced Operating Systems

Due Date: 14-11-2019

Assignment 1

Instructions to Solve Assignments

The purpose of assignments is to give you hands on practice. It is expected that students will solve the assignments themselves. Following rules will apply during the evaluation of assignment.

• Cheating from any source will result in zero marks in the assignment.
• Any student found cheating in any two of the assignments submitted will be awarded “F” grade in the course.
• No assignment after due date will be accepted.

Question 1: Total Points (10)

The maximum number of pages in process address space is one million and the total address size (p +d) of process address space is 32- bit with page size of 4096 bytes. Calculate the number of bits required for page number § and the number of bits required for offset (d)?

Question 2: Total Points (10+5)

a) Write a program using C/C++ to search the particular key element in the parent process and print the key to be searched in child process.
Hint: use fork( ) , Array
b) What will be the output of the following?

   #include <stdio.h> 
   #include <unistd.h> 

    int main() 
  { 
       if (fork() && (!fork())) { 
       if (fork() || fork()) { 
       fork(); 
           } 
                       } 
     printf("@ "); 
     return 0; 
      } 

Question 3: Total Points (15+10=25)
Read the paper titled “A Review of Lightweight Thread Approaches for High Performance Computing”
”, and answer the following questions:
(a) Write the brief summary of the given paper.
(b) Write a short note on the features of the lightweight (LWT) libraries discussed in the mentioned paper.
Note: Research paper is available in the zip folder.