×

Memory Management in Operating System

The term "Main Memory" refers to the computer's internal physical memory. It is distinguished from external mass storage devices like disk drives by using the term "main." RAM is another name for the main memory. The computer can only alter data in the main memory. As a result, the system's main memory must be dragged from a memory device for each program and file we run.

In order to run the programs, the main memory is loaded with them all. This mechanism is known as Dynamic Loading, and it improves performance by packing intact software into memory, but only rarely a crucial routine or part of the program is loaded into most of the memory.

Additionally, a program may depend on another program at times. When necessary, the CPU links the dependent programs to the most actively running program rather than loading all of them. This component is perceived as Dynamic Linking.

Memory Management in OS

What is Memory Management in Operating System?

Memory management is the process of coordinating and controlling a computer's memory. Blocks assign portions to various running programs to improve the system's overall performance. This method makes it easier to keep track of every memory location, regardless of whether it has been allocated to a process or is free.

This method decides when and which processes will receive memory. It likewise keeps the count of how much memory can be dispensed to a process. Because it keeps track of everything, any time memory is freed or unallocated, the status changes accordingly.

Memory management is a component of this activity that takes into account the memory device's capacity limitations by allocating memory space when it is no longer required or extending that space through virtual memory. Memory management aims to reduce memory usage so that the central processing unit (CPU) can quickly access the data and instructions it needs to carry out the various processes.

Methods for Memory Management

There are a variety of methods for memory management. The Operating System can use these methods to intelligently manage memory:

Memory Management in OS

Swapping in OS

In order to run the OS, a process needs to be in memory. However, there are times when a timesharing system's main memory is insufficient to accommodate all of the currently running processes. As a result, the extra process is brought in to run dynamically and stored on disk. The process of bringing each process in main memory, running it for some time, and then putting it back on the disk is known as swapping.

Contiguous Memory Allocation

In contiguous memory allocation, each process occupies a single, contiguous block of memory. Memory is divided into several partitions of the same size. One process is contained in each partition. A process from the input queue is selected and loaded into a free partition. Holes are the memory's unoccupied blocks. The best hole to allocate is searched through the set of holes.

Memory Protection

Memory protection is the process by which memory access rights on a computer can be controlled. Its primary objective is to prevent a process from accessing unallocated memory. After that it prevents a bug in a process from affecting other processes or the operating system as a whole, resulting in the sending of a segmentation fault or storage violation exception to the troublesome process and, typically, its termination.

Fragmentation

In a dynamic memory allocation system, fragmentation occurs when the majority of the free blocks are insufficient to fulfill any request. The inability to utilize the available memory is the most common name for it.

Processes are loaded into and out of memory in such a scenario. As a consequence of this, free holes are present in order to fulfill a request, but they are non-contiguous, or the memory is divided into large number of tiny cracks. This peculiarity is known as Outer Discontinuity.

Additionally, memory is allocated in terms of block sizes whenever the physical memory is divided into fixed-size blocks. It is possible that the requested memory is slightly larger than the space-allocated memory. Internal fragmentation refers to the memory that is internal to a partition but is of no use the difference between allocated and required memory.

Paging

Paging is one method for dealing with the fragmentation issue. Paging is a memory management technique that prevents a process's physical address space from spreading. Physical memory is here divided into Pages, equal-sized blocks. The pages of a particular process are loaded into memory frames that are available.

Page Table

A Page Table is the information structure involved by a virtual memory framework in a PC working framework to store the planning between the virtual location and actual addresses.

The CPU is responsible for creating the virtual address, which is also referred to as the logical address. While the actual memory address is known as the physical address.

Segmentation in OS

Another memory management method that allows users to view memory is OS Segmentation. Segmentation makes it possible to divide a single process's virtual address space into segments that can be stored in physical memory in non-contiguous locations.


Related Topics

Android Operating System

What is Android Operating System? Android is a Linux-based and open-source operating system mainly established for mobile devices like tablet computers and Smartphones. The Android operating system was established by the...

5 minutes read.

CPU Scheduling in OS

What is Scheduling? Scheduling is the process that is used to share the computing resources such as memory, processor time, and bandwidth to the different processes, data flows, threads, and applications that need...

5 minutes read.

Multiprogramming Operating System

You will discover more about the multiprogramming operating system in this post, including how it functions and its benefits and drawbacks. Each process needs several types of system time, including CPU...

4 minutes read.

Process Synchronization | Operating System

Process Synchronization Process Synchronization means managing the process in such a manner so that no two processes have access to share similar data and resources. We can use Process Synchronization in a Multi-Process System...

4 minutes read.

DOS Operating System

What is DOS Operating System? An operating system that runs from a hard disk drive is known as the DOS (Disk Operating System).In other words, DOS (Disk Operating System) is defined...

7 minutes read.

Resource Allocation Graph in Operating System

Resource Allocation Graph in OS We use the resource allocation graph for the pictographic representation of the state of a system. The resource allocation graph contains all the information related to the processes that...

5 minutes read.

Difference between Process and Program in the Operating System

What is a process in the Operating System? A process is a program that is going through the execution. It also helps us to execute all the lines of code in...

4 minutes read.

Round-Robin Scheduling Algorithm in OS

Round-Robin is a Preemptive Scheduling Algorithm and is the most commonly used algorithm in CPU Scheduling.In this, each Process is assigned with a fix time interval to execute, which is...

5 minutes read.

Monitors in Operating System

Monitors in Operating System Monitors are used for process synchronization. With the help of programming languages, we can use a monitor to achieve mutual exclusion among the processes. Example of monitors:...

3 minutes read.

What is Thread and Types of Thread

What is Thread A thread means a lightweight process. Thread is the basic unit of CPU execution, which consists of thread ID, Program counter, set of registers to hold the information of current...

7 minutes read.

MS-DOS Operating System

It is also referred to occasionally as "DOS", an abbreviation for disc operating systems. Operating systems with a graphical user interface (GUI) in different iterations of the graphical Microsoft Windows...

5 minutes read.

File Access Methods in Operating System

File Access Methods in OS There are various types of file access methods in the operating system: Sequential Access MethodDirect Access MethodIndex Sequential Access Method Sequential Access Method: - Sequential Access Method is...

3 minutes read.

Non-Contiguous Memory Allocation in Operating System

Memory is nothing but a storage space where various data are stored. We can store data in temporary and permanent memory as per our future requirements for data. We can...

9 minutes read.

Real-time Operating System

In this essay, we will thoroughly understand the real-time operating system. Real-Time Operating System: What do you mean? For any task to be completed, a real-time operating system (RTOS), a special-purpose operating...

5 minutes read.

Thrashing in Operating System

A virtual memory system's poor performance when the same pages are loaded repeatedly due to a lack of main memory to store them in secondary memory is referred to as...

3 minutes read.

Memory Management in Operating System

The term "Main Memory" refers to the computer's internal physical memory. It is distinguished from external mass storage devices like disk drives by using the term "main." RAM is another...

4 minutes read.

Advantages of UNIX Operating System

What is UNIX OS? UNIX is a family of multitasking, multiuser operating systems that are used on a wide variety of computer platforms. It was developed in the late 1960s and...

4 minutes read.

Test Set Lock Mechanism | Operating System

Modification in the Assembly Code The problem in the lock variable is that, in some cases, the process reads the previous or old value of the lock variable and enters into the critical...

4 minutes read.

Dining Philosophers Problem in Operating System

Edsger Wybe Dijkstra was a well-known Dutch scientist. He was the first person ever to present the Dining Philosophers Problem in the stream of Computer Science. The dining philosophers problem...

5 minutes read.

Why is it critical for the Scheduler to distinguish between I/O-bound and CPU-bound programs

A CPU-bound process is one that spends most of its time executing instructions on the processor. A process that is I/O-bound spends most of its time waiting for input and...

2 minutes read.