Practical Lab Manual

314454: OPERATING SYSTEM LABORATORY

Teaching Scheme: Examination Scheme:

Practical : 4 Hours/Week Term­work : 50 Marks Practical : 50 Marks

Prerequisites :

• 1. Data Structures

Course Objectives :

• 1. To familiarize the students with the Operating System.

  2. To demonstrate the process, memory, file and directory management issues under the UNIX/ LINUX operating system

  3. To introduce LINUX basic commands

  4. To make students how to make simple programs in LINUX and administrative task of LINUX

Course Outcomes :

• 1. Describe OS support for processes and threads

  2. Recognize CPU Scheduling, synchronization, and deadlock.

  3. Use C / C++ and Unix commands, and develop various system programs under Linux to make use of OS concepts related to process synchronization, shared memory, file systems, etc.

Laboratory Assignments

• 1. Process control system calls: The demonstration of fork, execve and wait system calls along with zombie and orphan states.

     1. 1. Implement the C program in which main program accepts the integers to be sorted. Main program uses the fork system call to create a new process called a child process. Parent process sorts the integers using merge sort and waits for child process using wait system call to sort the integers using quick sort. Also demonstrate zombie and orphan states.

        2. Implement the C program in which main program accepts an integer array. Main program uses the fork system call to create a new process called a child process. Parent process sorts an integer array and passes the sorted array to child process through the command line arguments of execve system call. The child process uses execve system call to load new program that uses this sorted array for performing the binary search to search the particular item in the array.

  2. Thread management using pthread library.

• • 1. Implement matrix multiplication using multithreading. Application should have pthread_create, pthread_join, pthread_exit. In the program, every thread must return the value and must be collected in pthread_join in the main function. Final sum of row-column multiplication must be done by main thread (main function).

• 3. Thread synchronization using counting semaphores and mutual exclusion using mutex. Application to demonstrate: producer­consumer problem with counting semaphores and mutex.

  4. Deadlock Avoidance Using Semaphores:

• • 1. Implement the deadlock­free solution to Dining Philosophers problem to illustrate the problem of deadlock and/or starvation that can occur when many synchronized threads are competing for limited resources.

• 5. Inter process communication in Linux using following.

• • • 1. Pipes : Full duplex communication between parent and child processes. Parent process writes a pathname of a file (the contents of the file are desired) on one pipe to be read by child process and child process writes the contents of the file on second pipe to be read by parent process and displays on standard output.

      2. FIFOs: Full duplex communication between two independent processes. First process accepts sentences and writes on one pipe to be read by second process and second process counts number of characters, number of words and number of lines in accepted sentences, writes this output in a text file and writes the contents of the file on second pipe to be read by first process and displays on standard output.

      3. Signals : Detecting the termination of multiple child processes :

         1. Implement the C program to demonstrate the use of SIGCHLD signal. A parent process Creates multiple child process (minimum three child processes). Parent process should be Sleeping until it creates the number of child processes. Child processes send SIGCHLD signal to parent process to interrupt from the sleep and force the parent to call wait for the Collection of status of terminated child processes.

• 6. Linux Kernel configuration, compilation and rebooting from the newly compiled kernel.

• • 1. Requirements:

    2. a. Get a Linux kernel source code from www.kernel.org

    3. b. Menu based configuration of Linux kernel using menuconfig/xconfig/gconfig

    4. c. Creating a monolithic compressed image of a kernel

    5. d. Compilation of kernel modules

    6. e. Installation of kernel modules

    7. f. Finalize installation

• 7. Kernel space programming: Implement and add a loadable kernel module to Linux kernel, demonstrate using insmod, lsmod and rmmod commands. A sample kernel space program should print the "Hello World" while loading the kernel module and "Goodbye World" while unloading the kernel module.

  8. Implement a new system call, add this new system call in the Linux kernel (any kernel source, any architecture and any Linux kernel distribution) and demonstrate the use of same.

  9. Implementing a CPU scheduling policy in a Linux OS.

• • 1. OR

    2. Implementing a memory management policy in a Linux OS.

    3. OR

    4. Implementing a file system in a Linux OS.

All the assignments should be conducted on Latest version of Open Source Operating Systems, tools and Multi­core CPU supporting Virtualization and Multi­Threading.

Links for Laboratory Assignments:

http://homes.cs.washington.edu/~tom/nachos/

http://web.cecs.pdx.edu/~walpole/class/cse513/project/syscall.html

http://web.cecs.pdx.edu/~walpole/class/cse513/project/syscall.html

This site is managed by,

Contact: Tushar B Kute (tushar@tusharkute.com)

Visit: http://www.tusharkute.com