Scribd
Upload
21 views12 pages

Swapping Contiguous Allocation

Uploaded by

anavadeepcs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
21 views12 pages

Swapping Contiguous Allocation

Uploaded by

anavadeepcs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Swapping

• Swapping is mechanism in which a


process
a can be moved temporarily from main
memory to secondary storage and
make that (disk)
processes.
memory available other
• At some later time, the systemto swaps back
the process from the secondary storage to
main memory.
Types of Memory Allocation
Contiguous memory allocation
Processes are assigned consecutive
memory blocks having consecutive
addresses.
Contiguous Memory Allocation
Non Contiguous memory allocation
• The Non-contiguous memory allocation allows
a process to acquire the several memory
blocks at the different location in the
memory according to its requirement.
Non Contiguous Memory Allocation
Types of partitioning in contiguous
• Fixed partitioning
memory allocation
Main memory is divided into several
partitions of size. Each partition
fixed only one process
accommodate can for execution.

• Dynamic partitioning
Partitions are created dynamically so that each
process is loaded into the partition of exactly the
same size as that of process.
Three strategies in contiguous
memory allocation
Three strategies in contiguous
memory allocation
• First-fit
First-fit allocates the first free partition which
is large enough to accommodate the process.
• Best-fit
Best-fit allocates the smallest free partition
that is large enough for that process.
• Worst-fit
It allocates the largest free partition.
Non-Contiguous
Allocation
Non-contiguous allocation divides the process
into several blocks and place them in the
different address space of the memory.

The following two schemes are available.


(i)Paging
(ii) Segmentation

You might also like