Skip to main content

Memory Management In Operting System


       ⇰  MEMORY MANAGEMENT :-

 To improve both the utilization of the CPU and the speed of its response to users, a general-purpose computer must keep several processes in memory. Many memory-management schemes exist, reflecting various approaches, and the effectiveness of each algorithm depends on the situation. Selection of a memory-management scheme for a system depends on many factors, especially on the hardware design of the system. Most algorithms require hardware support.


Memory management is one of the important functionality of operating system which handles or manages primary memory and moves processes back and forth between main memory and disk during execution (called swapping). Memory management keeps track of each and every memory location. It checks how much memory is to be allocated to processes. It decides which process will get memory at what time. 

Hence Memory Management is the process of controlling and coordinating computer memory, assigning portions known as blocks to various running programs to optimize the overall performance of the system. It is the most important function of an operating system that manages primary memory. It helps processes to move back and forward between the main memory and execution disk. 

Several methods are available that increase the effectiveness of memory management. There is virtual memory systems which separates the memory addresses used by a process from actual physical addresses. The quality of the virtual memory manager can have an extensive effect on overall system performance.

        ⇰  MEMORY MANAGEMENT TECHNIQUES :-

∗ The following are some common memory management techniques in operating system :-
i > Partitioned allocation:- In this technique memory is divided in different blocks or partitions. Each process is allocated according to the requirment.
ii > Paged memory management:- In this technique memory is divided into fixed sized units called page frames which is used in a virtual memory environment.
iii > Segmented technique :- In this technique memory is divided in different segments and   allocated memory doesn’t have to be contiguous.

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