CS703 - Advanced Operating Systems

CS703 – Advanced Operating Systems Due Date: 22-1-2020 Assignment 3 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 (25) There are four memory blocks partitions B1, B2, B3 and B4 in a system having sizes {100, 500, 200, 300, and 600} and there are four processes P1, P2, P3 and P4 having following sizes {212, 417, 112, 426}; Arrange the above given process using Best Fit Algorithm. Show diagrammatically the allocation of processes in the memory blocks Question 2: Total Points (10) Write down the functionality of the given UNIX system commands. Commands Functionality netstat time ps uptime vmstat gprof prof top chgrp touch Question 3: Total Points (10+10=20) Read the paper titled “A Study of Real-time Memory Management: Evaluating Operating System’s Performance” ”, and answer the following questions: (a) Write the brief summary of the given paper. (b) Write a short note on the memory allocators working Linux, Mac and Windows operating systems discussed in the mentioned paper. Note: Research paper is available in the zip folder.

CS703 – Advanced Operating Systems Due Date: 4-12-2019 Total Marks 50 Assignment 2 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) Consider performance of FCFS algorithm for three computer-bound processes. If process P1 takes 25 seconds, P2 takes 4 seconds and P3 takes 5 seconds and processes arrive in the given order P1, P2, P3. You need to calculate the following: a) Turnaround Time per process. b) Average Turnaround time of processes Question 2: Total Points (10) Calculate the Average Waiting Time for four processes. Assume that Processes arrives in the given sequence P1, P2, P4 and P3 at time=0 and scheduling algorithm applied is FCFS. Processes CPU Burst P1 5 P2 4 P3 2 P4 3 Question 3: Total Points (15+15=30) Read the paper titled “Boosting the Cloud Meta-Operating System with Heterogeneous Kernels. A Novel Approach Based on Containers and Micro services” ”, and answer the following questions: (a) Write the brief summary of the given paper. (b) Write a short note on the Meta Operating system discussed in the paper. Note: Research paper is available in the zip folder.

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 (p) 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.