Differences between internal and external fragmentation, Computer Engineering

Assignment Help:

Explain the differences between Internal and external fragmentation.

Internal and external fragmentation

(1) While memory allocated to a process is a little larger than the requested memory, space at the end of a partition is not used and wasted. Such wasted space inside a partition is termed as internal fragmentation. When sufficient total memory space exists to satisfy a request, but this is not contiguous; storage is fragmented in a large number of small holes. It wasted space not allocated to any partition is termed as external fragmentation.

 (2) Internal fragmentation is determined in multiple fixed partition schemes whereas all the partitions are of similar size. That physical memory is broken in fixed-sized blocks.

External fragmentation is determined in many variable partition schemes. In place of dividing memory in a fixed set of partitions, an operating system can select to allocate to a process the accurate amount of unused memory space this requires.

(3) In many fixed partition schemes, the partition table requires storing either the starting address for each process or the no. of the partition allocated to each process.

In many type of variable partition scheme, the overhead of managing extra data increases.

The partition table should store exact starting and ending location of each process and data about that memory locations are free should be maintained.

(4) In schemes of multiple fixed partitions, size/limit register is set at boot time and includes the partition size. All time a process is allocated control of CPU, the operating system only requires resetting the relocation register. Within multiple variable partition schemes, each time a diverse process is given control of the CPU, the operating system should reset the size/limit register in addition to the relocation register. The operating system should also make decisions on that partition this should allocate to a process.

(5) Internal fragmentation can be reduced by using multiple variable partition method. Though, this solution suffers from external fragmentation. This external fragmentation can be solved by using compaction where the goal is to shuffle the memory contents to place all free memory mutually in one large block. The other possible solution to the external fragmentation problem is to allow the logical address space of a process to be non-contiguous. Such solution is achieved by segmentation and paging.


Related Discussions:- Differences between internal and external fragmentation

Add the equation by using 2's compliment, Add 20 and (-15) using 2's comple...

Add 20 and (-15) using 2's complement ? Ans. Addition of 20 and (-15) by using 2's complement as (20) 10 = 1 0 1 0 0                                                  (16

Find the simplified function f and implement, Q. F'(a,b,c,d) = (a + b + d')...

Q. F'(a,b,c,d) = (a + b + d')(a + c' + d')(a + b' + c') d'(a,b,c,d) = (a + b' + c + d')(a' + c' + d')(a' + b + d) Find the simplified function F and implement it using NOR Ga

What is basic working of modem, Q. What is basic working of Modem? A mo...

Q. What is basic working of Modem? A modem (modulator/demodulator) is an electronic device that takes digital data as a serial stream of bits and produces a modulated carrier s

What do you mean by consumer behavior, What do you mean by consumer behavio...

What do you mean by consumer behavior? Explain the factors influencing consumer behavior? Factors Influencing Consumer Choice: Consumer choice or decision behaviour refers to t

What are the "field" and "chain" statements, What are the "field" and "chai...

What are the "field" and "chain" Statements? The FIELD and CHAIN flow logic statements let you Program your own checks. FIELD and CHAIN tell the system which fields you are ch

Student, Suppose we have an array-based list A[0..N - 1] and we want to del...

Suppose we have an array-based list A[0..N - 1] and we want to delete all duplicates. LastPosition is initially N - 1, but gets smaller as elements are deleted. Consider the pseudo

..binary tree, draw a binary tree from its inorder and preorder traversal s...

draw a binary tree from its inorder and preorder traversal sequences given as follows: inorder: d b g e h a c n f preorder: a b d e g h c f n

., advantages and disadvantages of a header node

advantages and disadvantages of a header node

What is a work process, What is a work process? A work process is where ...

What is a work process? A work process is where individual dialog steps are in fact processed and the work is done.  Every work process ocuurs one type of request.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd