Skip to main content

Contigeous Memory Allocation


  The main memory must accommodate or store both the operating system and the various user processes. So we need to allocate main memory in the most efficient way possible. As we know the memory is usually divided into two partitions: one for the operating system and other for the user processes. We can place the operating system in either low memory or high memory. Since the interrupt vector is often in low memory, programmers usually like to place the operating system in low memory.

  We usually want several user processes to reside in memory at the same time. We therefore need to consider how to allocate available memory to the processes that are in the input queue waiting to enter into memory. In contiguous memory allocation, each process is contained in a single section of memory that is contiguous to the section containing the next process. Thus we can say if the blocks are allocated to the file in such a way that all the logical blocks of the file get the contiguous physical block in the hard disk then such allocation scheme is known as contiguous allocation.The contiguous memory allocation can be implemented with the help of two registers:- Base and limit registers.

 When a process want to execute, memory is requested by the process. Then the size of process is compared with the amount of contiguous main memory available. If sufficient contiguous memory is found, the process is allocated memory to start its execution. Otherwise, it is added to a queue of waiting processes until sufficient free contiguous memory is available.


ADVANTAGES:-  
  i] This scheme is simple to implement. 
 ii] This scheme provides best read performance.
iii] This also supports random accessing.



 DISADVANTAGES:-
   i] The disk becomes fragmented.
  ii] The degree of multiprogramming is reduced.
iii] It may be difficult to have a file grow.


 CONTIGEOUS  V/S  NON-CONT. MEMORY ALLOCATION :-



click here for Tyes of memory allocation


Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above

Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process Scheduling And Types of Process Schedular :-

        ⇰ PROCESS SCHEDULING Process Scheduling  is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time.  ⏩   Followings are some objectives of Process Scheduling :-  i > To increase the amount of users within acceptable response times.  ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and  give reference to the processes holding the key resources.      ⇰  PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and  allows multiple users to shar...
8 comments
Read more

Semaphores In Process Synchronization

   ⇰  Semaphores :-   Semaphore is actually a method or tool to prevent race condition. Race condition can cause loss of data or even deadlock situation. For prevention from these conditions, the semaphore is one of the method.  Semaphore was proposed by Dijkstra in 1965. Simaphore    is a very significant technique to manage concurrent processes.  Semaphore is useful tool in the prevention of race condition. But the use of semaphore never means a guarantee that a program is free from these problems.     Semaphore is an integer variable which is used in mutual exclusive manner by various concurrent cooperative processes in order to acheive synchronization. Hence semaphore is one of the way to achieve synchronization.  Semaphore is basically  a variable which is non-negative and shared between threads. This variable is used to solve the critical section problem and to achieve process synchronization in the multiprocess...
Post a Comment
Read more

DeadLock In Operating System

      ⇰  DEADLOCK :- As we know in a multiprogramming environment several processes may compete for a finite number of resources. If a process requests resources and if the resources are not available at that time, the process enters a state called  waiting state. Sometimes, a waiting process is never again able to change state or never out from waiting state, because the resources it has requested are held by or taken by other waiting processes before this process.This situation is called a Deadlock.     ⇰  DEADLOCK CHARACTERIZATION:- In a deadlock processes never finish executing and system resources are tied up  and also  preventing other jobs from starting. Here are some features that characterize deadlocks. A deadlock situation can arrive if the following four conditions hold simultaneously in any operating system :- 1. Mutual exclusion :- A process must hold at least one resource in a nonsharable mode so tha...
3 comments
Read more