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

Explain about ALU organisation, ALU ORGANISATION An ALU performs simple...

ALU ORGANISATION An ALU performs simple arithmetic and logic operation as well as shift operations. Complexity of an ALU relies on the type of instruction set for that it has b

What is gdpro and magicdraw uml, What is GDPro and  MagicDraw UML GDP...

What is GDPro and  MagicDraw UML GDPro : This  is a full suite of code  management tools and UML. MagicDraw UML: UML diagrams fully support this: MagicDraw RConverter a

ANS, Smugglers are becoming very smart day by day. Now they have developed ...

Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send

Define the terms- action semantics and argouml, Define the terms- Action Se...

Define the terms- Action Semantics and  ArgoUML Action Semantics : Action semantics is a group of firms that have responded to the OMG's RFP to define the action semantics fo

Iterative deepening search, Iterative Deepening Search: So, breadth fi...

Iterative Deepening Search: So, breadth first search is always guaranteed to find a solution (if one exists), actually it eats all the memory. For the depth first search, ther

What are the data types of the external layer, What are the Data types of t...

What are the Data types of the external layer? The Data types of the external layer are :- ACCP, Char, CLNT, CUKY, CURR, DATS, DESC, FLTP, INT1, INT2, INT4, LANG, LCHR, L

Explain time complexity in parallel algorithms, Q. Explain Time Complexity ...

Q. Explain Time Complexity in Parallel algorithms? As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time

Full form of www, What do you understand by WWW WWW: The World Wide ...

What do you understand by WWW WWW: The World Wide is an architectural framework for accessing linked documents increase out over thousands of machines all over the world. It

Data structures for parallel algorithms, To apply any algorithm selection o...

To apply any algorithm selection of a proper data structure is very significant. An explicit operation might be performed with a data structure in a smaller time however it might n

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