Course Name- Operating System
Course Code – CSE 323
Topic – Fragmentation
Submitted By-
Iffat Firozy :163-15-8432
Khandakar Sanjana Akter Mun :163-15-8443
Maisha Mumtaz Monsur : 163-15-8438
Submitted to-
Ms. Zerin Nasrin Tumpa (Lecturer)
Department of Computer Science and Engineering
Iffat Firozy Rimi
ID: 163-15-8432
What is Fragmentation?
 As processes are loaded and removed from memory, the free
memory space is broken into little pieces. It happens after
sometimes that processes cannot be allocated to memory blocks
considering their small size and memory blocks remains unused.
This problem is known as Fragmentation.
Types of Fragmentation −
External fragmentation Vs Internal Fragmentation-
Different size memory block allocation. Fixed size memory block allocation.
Process release the RAM causes Fragmentation Assigned memory size is greater than requested.
Solution- segmentation , paging. Solution- Best Fit.
External
fragmentation
Internal
fragmentation
Khandakar Sanjana Akter Mun
Id: 163-15-8443
Process Process Size Status Available Memory
Size
P1 15 KB USED 15 KB
P2 5KB USED 5KB
P3 20KB USED 20KB
Process Process Size Status Available Memory
Size
15 KB
P2 5KB USED 5KB
P3 20KB USED 20KB
P1 terminated and 15 KB free
P3 terminated 20 KB free
After
Before
Process Process Size Status Available
Memory Size
P1 10KB USED 15KB
P2 15KB USED 15KB
P3 5KB USED 15KB
FREE 5KB
FREE 10KB
5KB WASTED
10KB WASTED
Paging
Paging is a memory management technique in which process address
space is broken into blocks of the same size called pages.
Maisha Mumtaz Monsur
ID:163-15-8438
Compaction
Compaction is a process in which the free space is collected in a large
memory chunk to make some space available for processes.
First Fit
o In the first fit approach is to allocate the first free partition or
hole large enough which can accommodate the process.
Best Fit
o The best fit deals with allocating the smallest free partition
which meets the requirement of the requesting process.
Worst fit
o In worst fit approach is to locate largest available free portion so
that the portion left will be big enough to be useful. It is the
reverse of best fit.

Fragmentaton

  • 1.
    Course Name- OperatingSystem Course Code – CSE 323 Topic – Fragmentation Submitted By- Iffat Firozy :163-15-8432 Khandakar Sanjana Akter Mun :163-15-8443 Maisha Mumtaz Monsur : 163-15-8438 Submitted to- Ms. Zerin Nasrin Tumpa (Lecturer) Department of Computer Science and Engineering
  • 2.
  • 3.
    What is Fragmentation? As processes are loaded and removed from memory, the free memory space is broken into little pieces. It happens after sometimes that processes cannot be allocated to memory blocks considering their small size and memory blocks remains unused. This problem is known as Fragmentation.
  • 4.
    Types of Fragmentation− External fragmentation Vs Internal Fragmentation- Different size memory block allocation. Fixed size memory block allocation. Process release the RAM causes Fragmentation Assigned memory size is greater than requested. Solution- segmentation , paging. Solution- Best Fit. External fragmentation Internal fragmentation
  • 5.
    Khandakar Sanjana AkterMun Id: 163-15-8443
  • 6.
    Process Process SizeStatus Available Memory Size P1 15 KB USED 15 KB P2 5KB USED 5KB P3 20KB USED 20KB Process Process Size Status Available Memory Size 15 KB P2 5KB USED 5KB P3 20KB USED 20KB P1 terminated and 15 KB free P3 terminated 20 KB free After Before
  • 7.
    Process Process SizeStatus Available Memory Size P1 10KB USED 15KB P2 15KB USED 15KB P3 5KB USED 15KB FREE 5KB FREE 10KB 5KB WASTED 10KB WASTED
  • 8.
    Paging Paging is amemory management technique in which process address space is broken into blocks of the same size called pages.
  • 9.
  • 10.
    Compaction Compaction is aprocess in which the free space is collected in a large memory chunk to make some space available for processes.
  • 11.
    First Fit o Inthe first fit approach is to allocate the first free partition or hole large enough which can accommodate the process. Best Fit o The best fit deals with allocating the smallest free partition which meets the requirement of the requesting process. Worst fit o In worst fit approach is to locate largest available free portion so that the portion left will be big enough to be useful. It is the reverse of best fit.