Unit 5 - Part 2 Notes

Difference between Internal fragmentation and External fragmentation
S.N
O Internal fragmentation External fragmentation
In internal fragmentation fixed- In external fragmentation, variable-

sized memory, blocks square sized memory blocks square measure
1. measure appointed to process. appointed to the method.
Internal fragmentation happens

External fragmentation happens when
when the method or process is
the method or process is removed.
2. smaller than the memory.
The solution to external

The solution of internal
fragmentation is compaction
fragmentation is the best-fit block.
3. and paging.
External fragmentation occurs when

Internal fragmentation occurs
memory is divided into variable size
when memory is divided
partitions based on the size of
into fixed-sized partitions.
4. processes.
The unused spaces formed

The difference between memory
between non-contiguous
allocated and required space or
memory fragments are too small to
memory is called Internal
serve a new process, which is called
fragmentation.
5. External fragmentation.
External fragmentation occurs with

Internal fragmentation occurs with
segmentation and dynamic
paging and fixed partitioning.
6. partitioning.
It occurs on the allocation of a

It occurs on the allocation of a
process to a partition greater than
process to a partition greater which is
the process’s requirement. The
exactly the same memory space as it
leftover space causes degradation
is required.
7. system performance.
S.N
O Internal fragmentation External fragmentation
It occurs in worst fit memory It occurs in best fit and first fit
8. allocation method. memory allocation method.
.NO Paging Segmentation
In paging, the program is divided In segmentation, the program is

1.
into fixed or mounted size pages. divided into variable size sections.
For the paging operating system For segmentation compiler is

2.
is accountable. accountable.
Page size is determined by Here, the section size is given by the

3.
hardware. user.
It is faster in comparison to
4. Segmentation is slow.
segmentation.
Paging could result in internal Segmentation could result in external

5.
fragmentation. fragmentation.
In paging, the logical address is

Here, the logical address is split into
6. split into a page number and page
section number and section offset.
offset.
Paging comprises a page table While segmentation also comprises

7. that encloses the base address of the segment table which encloses
every page. segment number and segment offset.
.NO Paging Segmentation
The page table is employed to Section Table maintains the section

8.
keep up the page data. data.
In segmentation, the operating system

In paging, the operating system
9. maintains a list of holes in the main
must maintain a free frame list.
memory.
10. Paging is invisible to the user. Segmentation is visible to the user.
In paging, the processor needs the In segmentation, the processor uses

11. page number, and offset to segment number, and offset to
calculate the absolute address. calculate the full address.
It is hard to allow sharing of Facilitates sharing of procedures

12.
procedures between processes. between the processes.
In paging, a programmer cannot It can efficiently handle data

13
efficiently handle data structure. structures.
Easy to apply for protection in

14. This protection is hard to apply.
segmentation.
The size of the page needs always There is no constraint on the size of
15.
be equal to the size of frames. segments.
A page is referred to as a physical A segment is referred to as a logical

16.
unit of information. unit of information.
Paging results in a less efficient Segmentation results in a more

17.
system. efficient system.
DEMAND PAGING
Demand paging can be described as a memory management technique that is used

in operating systems to improve memory usage and system performance. Demand
paging is a technique used in virtual memory systems where pages enter main
memory only when requested or needed by the CPU.
In demand paging, the operating system loads only the necessary pages of a
program into memory at runtime, instead of loading the entire program into
memory at the start.
A page fault occurred when the program needed to access a page that is not
currently in memory. The operating system then loads the required pages from the
disk into memory and updates the page tables accordingly. This process is
transparent to the running program and it continues to run as if the page had always
been in memory.
Benefits of the Demand Paging
So in the Demand Paging technique, there are some benefits that provide efficiency
of the operating system.
Efficient use of physical memory: Query paging allows for more efficient use
because only the necessary pages are loaded into memory at any given time.
Support for larger programs: Programs can be larger than the physical memory
available on the system because only the necessary pages will be loaded into
memory.
Faster program start: Because only part of a program is initially loaded into
memory, programs can start faster than if the entire program were loaded at once.
Reduce memory usage: Query paging can help reduce the amount of memory a
program needs, which can improve system performance by reducing the amount of
disk I/O required.
Drawbacks of the Demand Paging
Page Fault Overload: The process of swapping pages between memory and disk
can cause a performance overhead, especially if the program frequently accesses
pages that are not currently in memory.
Degraded performance: If a program frequently accesses pages that are not

currently in memory, the system spends a lot of time swapping out pages, which
degrades performance.
Fragmentation: Query paging can cause physical memory fragmentation,

degrading system performance over time.
Complexity: Implementing query paging in an operating system can be complex,

requiring complex algorithms and data structures to manage page tables and swap
space.

Unit 5 - Part 2 Notes

Uploaded by

Copyright:

Available Formats

Unit 5 - Part 2 Notes

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Unit 5 - Part 2 Notes

Uploaded by

Copyright:

Available Formats

Difference between Internal fragmentation and External fragmentation

In internal fragmentation fixed- In external fragmentation, variable-

Internal fragmentation happens

The solution to external

External fragmentation occurs when

The unused spaces formed

External fragmentation occurs with

It occurs on the allocation of a

.NO Paging Segmentation

In paging, the program is divided In segmentation, the program is

For the paging operating system For segmentation compiler is

Page size is determined by Here, the section size is given by the

Paging could result in internal Segmentation could result in external

In paging, the logical address is

Paging comprises a page table While segmentation also comprises

The page table is employed to Section Table maintains the section

In segmentation, the operating system

10. Paging is invisible to the user. Segmentation is visible to the user.

In paging, the processor needs the In segmentation, the processor uses

It is hard to allow sharing of Facilitates sharing of procedures

In paging, a programmer cannot It can efficiently handle data

Easy to apply for protection in

A page is referred to as a physical A segment is referred to as a logical

Paging results in a less efficient Segmentation results in a more

Demand paging can be described as a memory management technique that is used

Benefits of the Demand Paging

Degraded performance: If a program frequently accesses pages that are not

Fragmentation: Query paging can cause physical memory fragmentation,

Complexity: Implementing query paging in an operating system can be complex,

You might also like