Neha T

Memory allocation is an action of assigning the physical or the virtual memory address space to a process (its instructions and data). The two fundamental methods of memory allocation are static and dynamic memory allocation. Static memory allocation method assigns the memory to a process, before its execution. On the other hand, the dynamic memory allocation method assigns … [Read more...] about Memory Allocation

Several users create thousands and millions of files in a file system. To organize these files properly file system uses directory structure. The directory structure has the entries of the all the files related to that directory. We can consider that a directory is a file, that contains information about the other files. Here, we will discuss some common schemes defining the … [Read more...] about Directory Structure

For each process, the operating system maintains the data structure, which keeps the complete information about that process. This record or data structure is called Process Control Block (PCB). Whenever a user creates a process, the operating system creates the corresponding PCB for that process. These PCBs of the processes are stored in the memory that is reserved for the … [Read more...] about Process Control Block (PCB)

Multithreading Models in Operating System exhibit the ways of mapping the user threads to the kernel threads. Here, we will learn about the three multithreading models, Many to One model, One to One model and Many to Many model. Many to One multithreading model maps many user threads to only one kernel thread. One to One multithreading model maps a single user thread to a … [Read more...] about Multithreading Models in Operating System

Shared memory system is one of the fundamental models of interprocess communication. In the shared memory system, the cooperating processes communicate with each other by establishing the shared memory region, in its address space. Shared memory model allows the fastest interprocess communication. Among the cooperating processes, the process that wants to initiate the … [Read more...] about Shared Memory System in IPC

First Come First Serve (FCFS) is the simplest CPU scheduling algorithm where the process that arrives first in the ready queue will be serviced first by CPU. Secondly, the FCFS is a non-preemptive scheduling algorithm in which once the process is allotted the CPU cycles it releases CPU when the process terminates or if it requests I/O. We can understand it with an example, … [Read more...] about First Come First Serve (FCFS) Scheduling Algorithm