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 »
Deadlock Prevention
Deadlock prevention means to prevent at least one of the necessary conditions from occurring. The methods to prevent the individual conditions are discussed below:
Deadlock in Operating System
Deadlock is a situation which occurs when a process or thread enters a waiting state because a resource requested is being held by another waiting process,
Program to simulate Race Condition
Program to create two threads: one to increment the value of a shared variable and second to decrement the value of shared variable.
Page Replacement Algorithm
There are three basic page replacement algorithms: first in first out, least recently used and
Virtual Memory
Virtual memory is a mechanism that creates the illusion of having a very big main memory. With the concept of virtual memory, the user can store processes with size bigger than the available main memory
Program to create Threads in Linux
Program to create threads using C in Linux
Segmentation
Segmentation is a non-contiguous memory management technique in which the program is divided into variable size parts called segments.