Skip to main content

Fragmentation In Operating System

  As processes are loaded and removed from memory during allocation of memory, the free memory space is broken into little pieces. After sometimes a process cannot allocate memory due to various small leftover space. This occurance is called fragmentation. At this condition there is many small and unused holes scattered throughout memory. Therefore we can say when many of the free blocks are too small to satisfy any request.

Memory fragmentation is of two types :-
 i> Internam Fragmentation.
ii> External Fragmentation.


 i> Internam Fragmentation :- It is a type of memory fregmentation. Internal fragmentation is the space, which wasted inside of allocated memory blocks because of restriction on the allowed sizes of allocated blocks only. Allocated memory may be slightly larger than the requested memory. This size difference is memory internal to a partition, but never being used.



ii> External Fragmentation :- It is a type of memory fragmentation. External fragmentation exists when there is enough total memory space to satisfy a request but the available spaces are not contiguous.The memory is fragmented into a large number of small holes.  If all these small pieces of hole were in one large hole, we might be able to run several more processes. In the worst case, we could have a block of free  memory between every two processes.Depending on the total amount of memory storage and the average process size, external fragmentation may be a minor or a major problem.



One solution to the problem of external fragmentation is compaction. The goal is to shuffle the memory contents so as to place all free memory together in one large block or hole. Compaction is not always possible, It is possible only if relocation is dynamic and is done at execution time.The simplest compaction algorithm is to move all processes toward one end of memory and all holes move in the other direction, producing one large hole of available memory.

There are many differences between Internam and External fragmentation as follows :-

     

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 share system resources  to achieve  multiprogramming .  There are  mainy three types of pro
8 comments
Read more

Process & Its state And process control block :-

                ⇰  PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution.             A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads.         The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two types:-  i> System  Process. ii> User Process. Early computers allowed only one program be ex
Post a Comment
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 multiprocessing environment. Semaphore contains some operations as f
Post a Comment
Read more