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

Software engineering - layered technology, S oftware Engineering - Layered...

S oftware Engineering - Layered Technology Although various authors have developed personal definitions of software engineering, a definition given by Fritz Bauer at the semin

Linux, Explain about unix file system architecture

Explain about unix file system architecture

Minimum and maximum algorithm, For this assignment, you will need to create...

For this assignment, you will need to create an ARM assembly language code routine that implements an algorithm to search through an array and find BOTH the minimum and maximum val

Scanf function, How can the maximum field width for a data item be specifie...

How can the maximum field width for a data item be specified within a scanf function? When the program is executed, three integer quantities will be entered from the standard i

What are the types of data warehouses, What are the types of data warehouse...

What are the types of data warehouses? Various types of data warehouses are illustrated below: a) Financial Data Warehouses b) Insurance Data Warehouses c) Human Resou

Show the conflict in register, Q. Show the conflict in register? All mi...

Q. Show the conflict in register? All micro-operations written on a line are to be executed at same time provided the statements or a group of statements to be implemented toge

Weka uses a gaussian - radial basis function, A data set with 1000 rows is ...

A data set with 1000 rows is input to a neural network in Weka. The test option is set to 10-fold cross validation and the neural network option validationSetSize = 20%. How many r

Explian two limitations of dead-box analysis, (a) Explian two limitations o...

(a) Explian two limitations of dead-box analysis. (b) Describe why memory analysis is difficult. (c) With reference to the "Shadow Walker" rootkit, explain what is meant by

Fully parallel associative processor (fpap), Fully Parallel Associative Pro...

Fully Parallel Associative Processor (FPAP):  This processor accepts the bit parallel memory organisation. FPAP has two type of this associative processor named as: Word Org

Program accept decimal number and convert it into given base, Q Develop a p...

Q Develop a program that accepts decimal number and converts it into given base. Fractional numbers are allowed and negative numbers are not allowed. Also check that entered number

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