Os Lab Manual

GC UNIVERSITY LAHORE
Department of Computer Science

Bachelor of Computer Science, BS (CS)
LAB MANUAL
Operating Systems
COURSE CODE: CS-2205
INSTRUCTOR
Awais Qasim
Operating Systems LABORATORY
Aim:
To give students a practical exposure to the internal working of operating systems. An open source operating
system i-e Fedora has been specially chosen for this purpose.Every section in the lab plan has one scheduled lab
every week. The table below shows the weekly division of lab exercises:
LAB PLAN
SI.No
Name of the task
Date
To create a new child process using fork system call.
To block a parent process until child completes using 12/2/14

wait system call.
To load an executable program in a child process using

execsystem call.
19/2/14
To display file status using stat system call.
26/2/14
To create a file and to write contents.
5/3/14
To read the given file and to display file contents.
12/3/14
To append contents to an existing file.
19/3/14
To simulate grep command using UNIX system call.
26/3/14
To simulate cp command using UNIX system call.
2/4/14
10
To schedule snapshot of processes queued according

to FCFS (First Come First Serve) scheduling.
9/4/14
11
To demonstrate communication between process

using shared memory.
16/4/14
12
To synchronize producer and consumer processes

using semaphore.
23/4/14
13
Write a C Program to implement Contiguous File

Allocation method
30/4/14
14
To implement page replacement algorithmsFIFO (First

In First Out)
7/5/14
15
To implement page replacement algorithmLRU (Least

Recently Used)
14/5/14
5/2/14
FORK SYSTEM CALL
AIM:
To create a new child process using fork system call.
ALGORITHM:
1.Declare a variable x to be shared by both child and parent.
2. Create a child process using fork system call.
3. If return value is -1 then
a.Print "Process creation unsuccessfull"
b.Terminate using exit system call.
4.If return value is 0 then
a.Print "Child process"
b.Print process id of the child using getpid system call
c.Print value of x
d.Print process id of the parent using getppid system call
5.Otherwise
a.Print "Parent process"
b.Print process id of the parent using getpid system call
c.Print value of x
d.Print process id of the shell using getppid system call.
6.Stop
Result
Thus a child process is created with copy of its parent's address space.
WAIT SYSTEM CALL
AIM:
To block a parent process until child completes using wait system call.
ALGORITHM:
1.Create a child process using fork system call.
2.If return value is -1 then
a.Print "Process creation unsuccessful"
3.If return value is > 0 then
a.Suspend parent process until child completes using wait system call
b.Print "Parent starts"
c.Print even numbers from 010
d.Print "Parent ends"
a.Print "Child starts"
b.Print odd numbers from 010
c.Print "Child ends"
5.Stop
Result
Thus using wait system call zombie child processes were avoided.
EXEC SYSTEM CALL
AIM:
To load an executable program in a child processesexecsystem call..
ALGORITHM:
1.If no. of command line arguments 3 then stop.
2.Create a child process using fork system call.
3.If return value is -1 then
a.Print "Process creation unsuccessfull"
4.If return value is > 0 then
a.Suspend parent process until child completes using wait system call
b.Print "Child Terminated".
c.Terminate the parent process.
a.Print "Child starts"
b.Load the program in the given path into child process using exec system call.
c.If return value of exec is negative then print the exception and stop.
d.Terminate the child process.
6.Stop
Result
Thus the child process loads a binary executable file into its address space.
STAT SYSTEM CALL
AIM:
To display file status using stat system call.
ALGORITHM:
1.Get filename as command line argument.
2.If filename does not exist then stop.
3.Call stat system call on the filename that returns a structure
4.Display members st_uid, st_gid, st_blksize, st_block, st_size, st_nlink , etc.,
5.Convert time members such as st_atime, st_mtime into time using ctime function
6.Compare st_mode with mode constants such as S_IRUSR, S_IWGRP, S_IXOTHand display file
permissions.
7.Stop
Result
Thus attributes of a file are displayed using stat system call.
OPEN SYSTEM CALL
AIM:
To create a file and to write contents.
ALGORITHM:
1.Declare a character buffer buf to store 100 bytes.
2.Get the new filename as command line argument.
3.Create a file with the given name using open system call with O_CREAT and O_TRUNC options.
4.Check the file descriptor.
a)If file creation is unsuccessful, then stop.
5.Get input from the console until user types Ctrl+D
a)Read 100 bytes (max.) from console and store onto buf using read system call
b)Write length of buf onto file using write system call.
6.Close the file.
7.Stop
Result
Thus a file has been created with input from the user. The process can be verified by using cat
command.
READ SYSTEM CALL
AIM:
To read the given file and to display file contents.
ALGORITHM:
2.Get existing filename as command line argument.
3.Open the file for reading using open system call with O_RDONLY option.
a)If file does not exist, then stop.
5.Read until end-of-file using read system call.
a)Read 100 bytes (max.) from file and print it
6.Close the file.
7.Stop
Result
Thus the given file is read and displayed on the console. The process can be verified by using cat
command.
WRITE SYSTEM CALL
AIM:
To append contents to an existing file.
ALGORITHM:
2.Get exisiting filename as command line argument.
3.Create a file with the given name using open system call with O_APPEND option.
a)If value is negative, then stop.
5.Get input from the console until user types Ctrl+D
a)Read 100 bytes (max.) from console and store onto buf using read system call
b)Write length of buf onto file using write system call.
6.Close the file.
7.Stop
Result
Thus contents have been written to end of the file. The process can be verified by using cat command.
GREP COMMAND
AIM:
To simulate grep command using UNIX system call.
ALGORITHM:
1.Get filename and search string as command-line argument.
2.Open the file in read-only mode using open system call.
3.If file does not exist, then stop.
4.Let length of the search string be n.
5.Read line-by-line until end-of-file
a.Check to find out the occurrence of the search string in a line by examining characters in the
range 1n, 2n+1, etc.
b.If search string exists, then print the line.
6.Close the file using close system call.
7.Stop.
Result
Thus the program simulates grep command by listing lines containing the search text.
CP COMMAND
AIM:
To simulate cp command using UNIX system call.
ALGORITHM:
1.Get source and destination filename as command-line argument.
2.Declare a buffer of size 1KB
3.Open the source file in readonly mode using open system call.
4.If file does not exist, then stop.
5.Create the destination file using create system call.
6.If file cannot be created, then stop.
7.File copy is achieved as follows:
a.Read 1KB data from source file and store onto buffer using read system call.
b.Write the buffer contents onto destination file using write system call.
c.If end-of-file then step 8 else step 7a.
8.Close source and destination file using close system call.
9.Stop.
Result
Thus a file is copied using file I/O. The cmp command can be used to verify that contents of both file
are same
FCFCS SCHEDULING
AIM:
To schedule snapshot of processes queued according to FCFS (First Come First Serve) scheduling.
ALGORITHM:
1.Define an array of structure process with members pid, btime, wtime&ttime.
2.Get length of the ready queue, i.e., number of process (say n)
3.Obtain btime for each process.
4.The wtime for first process is 0.
5.Compute wtime and ttime for each process as:
6.Compute average waiting time awat and average turnaround time atur
7.Display the btime, ttime and wtime for each process.
8.Display GANTT chart for the above scheduling
9.Display awat time and atur
10.Stop
Output
Enter number of processors:3
Enter the Burst Time of the process 1: 2
FIRST COME FIRST SERVE SCHEDULING ALGORITHM
Process ID
Waiting Time Turn Around Time
11
Average Waiting Time 3.00

Average Turnaround Time 6.67
SHARED MEMORY
AIM:
To demonstrate communication between process using shared memory.
ALGORITHM:
1.Initialize size of shared memory shmsize to 27.
2.Initialize key to 2014 (some random value).
3.Create a shared memory segment using shmget with key & IPC_CREAT as parameter.
a.If shared memory identifier shmid is -1, then stop.
4.Display shmid.
5.Attach server process to the shared memory using shmmat with shmid as parameter.
a.If pointer to the shared memory is not obtained, then stop.
6.Clear contents of the shared region using memset function.
7.Write az onto the shared memory.
8.Wait till client reads the shared memory contents
9.Detatch process from the shared memory using shmdt system call.
10.Remove shared memory from the system using shmctl with IPC_RMID argument
11.Stop
Client
1.Initialize size of shared memory shmsize to 27.
2.Initialize key to 2014 (same value as in server).
3.Obtain access to the same shared memory segment using samekey.
a.If obtained then display the shmid else print "Server not started"
4.Attach client process to the shared memory using shmmat with shmid as parameter.
a.If pointer to the shared memory is not obtained, then stop.
5.Read contents of shared memory and print it.
6.After reading, modify the first character of shared memory to '*'
7.Stop
Result
Thus contents written onto shared memory by the server process is read by the client
process.
PRODUCER-CONSUMER PROBLEM
Aim:
To synchronize producer and consumer processes using semaphore.
Algorithm:
1. Create a shared memory segment BUFSIZE of size 1 and attach it.
2. Obtain semaphore id for variables empty, mutex and full using semget function.
3. Create semaphore for empty, mutex and full as follows:
a. Declare semun, a union of specific commands.
b. The initial values are: 1 for mutex, N for empty and 0 for full
c. Use semctl function with SETVAL command
4. Create a child process using fork system call.
a. Make the parent process to be the producer
b. Make the child process to the consumer
5. The producer produces 5 items as follows:
a. Call wait operation on semaphores empty and mutex using semop function.
b. Gain access to buffer and produce data for consumption
c. Call signal operation on semaphores mutex and full using semop function.
6. The consumer consumes 5 items as follows:
a. Call wait operation on semaphores full and mutex using semop function.
b. Gain access to buffer and consume the available data.
c. Call signal operation on semaphores mutex and empty using semop function.
7. Remove shared memory from the system using shmctl with IPC_RMID argument
8. Stop
Result
Thus synchronization between producer and consumer process for access to a shared
memory segment is implemented.
Output
Enter data for producer to produce : 5
Consumer consumes data 5
CONTIGUOUS FILE ALLOCATION
AIM:
Write a C Program to implement Contiguous File Allocation method.
ALGORITHM:
Step 1: Start the program.
Step 2: Get the number of memory partition and their sizes.
Step 3: Get the number of processes and values of block size for each process.
Step 4: First fit algorithm searches all the entire memory block until a hole which is big enough is
encountered. It allocates that memory block for the requesting process.
Step 5: Best-fit algorithm searches the memory blocks for the smallest hole, which can be allocated to
requesting process, and allocates if.
Step 6: Worst fit algorithm searches the memory blocks for the largest hole and allocates it to the
process.
Step 7: Analyses all the three memory management techniques and display the best algorithm which
utilizes the memory resources effectively and efficiently.
Step 8: Stop the program.
OUTPUT:
Enter no.of files: 2
Enter no. of blocks occupied by file1 4
Enter the starting block of file1 2
Enter no. of blocks occupied by file2 10
Enter the starting block of file2 5
Filename
Start block
length
10
Enter file name: Test

File name is:12803 length is:0blocks occupied
FIFO PAGE REPLACEMENT ALGORITHM
AIM:
To implement page replacement algorithmsFIFO (First In First Out).
ALGORITHM:
FIFO:
Step 1: Create a queue to hold all pages in memory
Step 2: When the page is required replace the page at the head of the queue
Step 3: Now the new page is inserted at the tail of the queue
OUTPUT:
FIFO PAGE REPLACEMENT ALGORITHM
Enter no.of frames....4

Enter number of reference string.. 6
Enter the reference string.. 5 6 4 1 2 3
The given reference string: ...................................... 5 6 4 1 2 3
Reference np5->
5 -1 -1 -1
Reference np6->
5 6 -1 -1
Reference np4->
5 6 4 -1
Reference np1->
5 6 4 1
Reference np2->
2 6 4 1
Reference np3->
2 3 4 1
No.of pages faults...6
LRU PAGE REPLACEMENT ALGORITHM
AIM:
To implement page replacement algorithmLRU (Least Recently Used).
ALGORITHM:
Step 1: Create a queue to hold all pages in memory
Step 2: When the page is required replace the page at the head of the queue
Step 3: Now the new page is inserted at the tail of the queue
Step 4: Create a stack
Step 5: When the page fault occurs replace page present at the bottom of the stack
OUTPUT:
Enter no.of Frames....3
Enter no.of reference string..6
Enter reference string. 6 5 4 2 3 1
LRU PAGE REPLACEMENT ALGORITHM

The given reference string:
. 6 5 4 2 3 1
Reference NO 6->
6 -1 -1
Reference NO 5->
6 5 -1
Reference NO 4->
6 5 4
Reference NO 2->
2 5 4
Reference NO 3->
2 3 4
Reference NO 1->
2 3 1
No.of page faults...6

Os Lab Manual

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Os Lab Manual

Загружено:

Авторское право:

Доступные форматы

GC UNIVERSITY LAHORE

Department of Computer Science

Name of the task

To create a new child process using fork system call.

To block a parent process until child completes using 12/2/14

To load an executable program in a child process using

To display file status using stat system call.

To create a file and to write contents.

To read the given file and to display file contents.

To append contents to an existing file.

To simulate grep command using UNIX system call.

To simulate cp command using UNIX system call.

To schedule snapshot of processes queued according

To demonstrate communication between process

To synchronize producer and consumer processes

Write a C Program to implement Contiguous File

To implement page replacement algorithmsFIFO (First

To implement page replacement algorithmLRU (Least

Waiting Time Turn Around Time

Average Waiting Time 3.00

Enter file name: Test

Enter no.of frames....4

The given reference string: ...................................... 5 6 4 1 2 3

No.of pages faults...6

LRU PAGE REPLACEMENT ALGORITHM

No.of page faults...6

Вам также может понравиться