Skip to content

Tag Archives: Operating Systems-Memory Management

The process of dividing a computer file, such as a data file or an executable program file, into fragments that are stored in different parts… Read More
The disk attachment is a special feature that allows you to attach a disk (such as a USB flash drive) to your computer’s hard drive.… Read More
Paging is an important concept in memory management. In Paging, the operating system divides each incoming program into pages of equal sizes of blocks. The… Read More
Defragging is the process of locating and rearranging file fragments on the storage so that they occupy a single contiguous storage. This process is done… Read More
Overview :You might have studied many memory management systems OS uses to utilize the memory, but a special type of memory management is used nowadays… Read More
The term Memory can be defined as a collection of data in a specific format. It is used to store instructions and process data. The… Read More
Prerequisite – Partition Allocation Methods Contiguous Memory Allocation :Probably the least difficult technique for the memory portion is to isolate memory into a few fixed… Read More
In this article, we are going to cover the performance of paging and will also cover the expression for evaluating paging performance. Let’s discuss one… Read More
For both fixed and dynamic memory allocation schemes, the operating system must keep a list of each memory location noting which are free and which… Read More
Program is a sequence of instructions written by the user that instructs the computer to perform the task of solving some problem. We will now… Read More
Copy on Write or simply COW is a resource management technique. One of its main use is in the implementation of the fork system call… Read More
Most of the computers that are used today are of the kinds: Traditional BIOS-MBR type, and UEFI-GPT method (used by advance/latest computers). Step-1: Power Supply:… Read More
Paging is the process in which we convert the entire process into equal-sized pages. Each page further consists of a fixed number of words (if… Read More
Prerequisite – Least Recently Used (LRU) Page Replacement algorithm Least Recently Used page replacement algorithm replaces the page which is not used recently. Implementation: In… Read More
Prerequisite – Belady’s Anomaly Belady’s Anomaly is when the number of page faults increases even after increasing the number of frames. In this article, we demonstrate Belady’s… Read More

Start Your Coding Journey Now!