×

Contiguous Memory Allocation in Operating System

Memory is a place where data, facts, figures, and information are stored for temporary or permanent access the data in future, which is also considered as the storage place.

Allocation of memory refers to the concept of providing certain memory or storage space to certain data; for example, if we enter the Z alphabet from the keyboard, the system will allocate memory for Z, and if we assign 99 value to Z, the system will store 99 at the Z location ( Here, Z is considered as a location in memory for human understanding only, but inside the system, there is no such location named as Z. Inside the system Z is also stored at the certain address which is a set of binary numbers. )

Memory Management Strategies:

There are two types of memory management strategies, which are given below:

1) Contiguous Memory Allocation

  1.  Fixed Partition
  2.  Variable/Dynamic Partition

2) Non-Contiguous Memory Allocation

Contiguous Memory Allocation: It refers to the concept of providing continuous memory/space to similar types of processes, irrespective of the number of processes. For example, if a process contains four blocks named as Zi, Zii, Ziii, and Ziv, the system will try to allocate/ provide a contiguous address to the entire block of that process in the RAM. It will allocate Zi next to Zii and Zii next to Ziii, and so on.

Contiguous memory allocation is one of the most important strategies for memory management. In this method, the memory is either branched in fixed sizes and slots or randomly branched as per the size and space required by the file. One single process holds an individual (entire) partition of contiguous memory, and because of this feature, it becomes very easy to access any random data from its process.   

  1. Fixed Partition: Fixed partition of memory is associated with the concept of contiguous memory allocation. This method allows us to divide the memory into certain fixed parts or make various slots of the same size. Nowadays, this method is no longer used because there are various evolved and modern forms of this method, which are way better and improved methods than fixed partitioning. Some of them are paging, segmentation, multilevel paging, inverted paging, etc. (the fixed method is the basis of all mentioned methods, all of these methods are the developed and improved versions of the static method). The Fixed Partitioning method was used in the 20th century around 1960. It was mainly used in the main frames or for big servers. 
  2. Dynamic Partition: Dynamic/ Variable partition of memory is associated with the concept of contiguous memory allocation. This method does not allow the partition of memory into fixed parts. As per the name suggests, it is dynamic in nature, and we cannot divide the memory into slots. In this method, we directly allocate the memory as per need depending on the file size or process.

Advantages of Contiguous Memory Allocation

There are certain advantages of allocating the memory contiguously, which are as follows:

  1. Implementation using contiguous memory allocation becomes very easy as compared to other methods used for memory management. In dynamic memory allocation, we use pointers to store the addresses, and indexes are also required. In contiguous allocation, there is no need for an index, no need for a pointer. We can put the data, and it will allocate memories as per length of the file and make it easy to implement.
  2. One of the advantages of contiguous memory allocation is that we can directly access any file from a disk. It takes a minimum to seek time, as there is no need to change track to access the data in the same file. We can access any random file from the track with the minimum time required.
    It has a magnificent reading performance.

Disadvantages of Contiguous Memory Allocation:

  1. One of the major disadvantages of contiguous memory allocation is external fragmentation. External fragmentation refers to the situation where there is the availability of memory in the system. Still, we cannot store any data or use that memory due to contiguous memory allocation.  
Contiguous Memory Allocation in Operating System
  • While using contiguous memory allocation, it is really difficult to edit and expand files. We can only add more data to the file if there is enough contiguous space available on the disk. We cannot add more data to a file if contiguous space is not available, hence cannot expand the file later.
  • Internal fragmentation is also considered as one of the disadvantages of contiguous memory allocation. It is a huge problem and is not only associated with contiguous memory allocation. It is a situation where a file uses less space for storage than the available space, and the remaining memory is wasted.

Related Topics

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.

Functions of Operating System

The functions of Operating System are: Process Management Memory Management File Management Device Management Secondary storage Management Security Coordination between other software and users Networking Job Accounting Error detecting aids 1. Process Management Process Management support operating system to create and delete...

3 minutes read.

File in Operating System

What is File in Operating System?  A file is defined as a collection of the interrelated information that is stored in the secondary memory or the non-volatile memory such as optical...

4 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.

Need of Operating System

There are various needs of operating system: Managing Input-Output UnitThe Operating system as a platform for application programsMultitaskingConsistent user interface Managing Input-Output Unit: - With the help of the operating system, the...

2 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.

HRRN Scheduling in OS

Highest Response Ratio Next (HRRN) Scheduling in OS Highest Response Ratio Next Scheduling is a Non-Preemptive Scheduling algorithm. This algorithm provides the benefits of the shortest job first scheduling algorithm and also removes...

6 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.

Segmentation in Operating System

The term segmentation in operating system refers to the division of computer memory into segments. Segmentation is a technique used by many modern operating systems to provide better memory management....

4 minutes read.

Operating System Properties

The Properties of Operating System are: Batch processingMultitaskingMulti-programmingInteractivityReal-Time SystemDistributed Environmentspooling 1. Batch Processing In Batch Processing, the OS first gathers the data and programs together in a batch, then processing starts. The operating system...

3 minutes read.

Inter Process Communication in Operating System

Inter-Process Communication or IPC refers to the methods and techniques that allow processes (programs or tasks) to communicate with each other within a computer system. This is typically done through...

3 minutes read.

Booting Process in Operating System

What is Booting? Booting is defined as the term which says that the process of loading the operating system into the memory. The process of booting begins when we switch on...

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.

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.

Difference between Multi-programming and Multitasking

Difference between Multiprogramming and Multitasking         Multiprogramming  Multitasking In Multiprogramming, at the same time, we can run the multiple processes concurrently on one...

2 minutes read.

Disk Scheduling Algorithms

Disk Scheduling Algorithms Disk scheduling algorithms are the algorithms that are used for scheduling a disk. Generally, the scheduling refers to a time-table for completing any task or a job. With the help...

2 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.

Semaphore in Operating System

What is Semaphore in Operating System Semaphore is defined as an integer variable which is used to solve the problem of the critical section in process synchronization. In semaphore, we use...

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.

Difference between Protection and Security in Operating System

Some operating system mechanisms facilitate us to stop tampering with logical and physical resources. Some of these methods are security and protection. Protection and security are distinct concepts, despite the...

3 minutes read.