Program for Process Synchronization using Semaphores
int shared=1; //shared variable
sem_t s; //semaphore variable
int main()
{
sem_init(&s,0,1)
Resource Allocation Graph
Resource Allocation graph technique is used for deadlock avoidance when there is a single instance of every resource. In resource allocation graph for
Free-Space List Management
The capacity of any disk is limited (e.g., 500 GB, 1TB etc.). Thus, to accommodate our new files, the space freed by deleted files is reused by the system by maintaining a free-space list.
Program to create an orphan process
An orphan process is a process whose parent has finished. Suppose P1 and P2 are two process such that P1 is the parent process and P2
Deadlock Avoidance
In deadlock avoidance, the operating system is provided with extra information related to all resources any process will require during its lifetime.
File Allocation Method
We all save our files in the hard disk. To make the maximum out of the disk we space the files have to be stored in an efficient manner.
Program to replace process image using execl( )
There is a family of function which can be used for replacing the current process with a new process. They differ in the number of arguments and the way they start a new process. The various functions are execl, execlp, execle, execv and execvp. In this post we will write a Program to replace process image using execl( …
Uni-programming vs Multi Programming vs Time Sharing
In batch processing a batch of similar kinds of jobs are made and submitted one by one to the system. From within the batch the jobs are processed one by one.
MCQ’s based on Process Scheduling
[June, 2013] Consider the following set of processes with the length of CPU burst time in milliseconds (ms) :
Program for Process Synchronization using mutex locks
/* Program for process synchronization using locks Program create two threads: one to increment the value of a shared variable and second to decrement the value of shared variable. Both the threads make use of locks so that only one of the threads is executing in its critical section */ #include<pthread.h>#include<stdio.h>#include<unistd.h>void *fun1();void *fun2(); int shared=1; …
Program for Process Synchronization using mutex locks Read More »