Scribd
Upload
14 views

OS-IPC&Mem MGMT New

Uploaded by

sreejo550
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
14 views

OS-IPC&Mem MGMT New

Uploaded by

sreejo550
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/ 26

What is Memory Management?

 Memory Management is the process of controlling and


coordinating computer memory, assigning portions known as
blocks to various running programs to optimize the overall
performance of the system.
 Memory Management Techniques
 Single Contiguous Allocation
 It is the easiest memory management technique. In this
method, all types of computer’s memory except a small
portion which is reserved for the OS is available for one
application.
 Partitioned Allocation

 It divides primary memory into various memory partitions,


which is mostly contiguous areas of memory. Every partition
stores all the information for a specific task or job. This
method consists of allotting a partition to a job when it starts &
unallocated when it end
Non -Contiguous Allocation
Paged Memory Management

Paging is a fixed size partitioning
scheme.

In paging, secondary memory and main
memory are divided into equal fixed size
partitions.

The partitions of secondary memory are
called as pages.

The partitions of main memory are called as
frames.

Each process is divided into parts where
size of each part is same as page size.

The size of the last part may be less than
the page size.

The pages of process are stored in the
frames of main memory depending upon
their availability.
Paged Memory Management
 .
Segmented Memory Management

In segmentation, process is not divided blindly into
fixed size pages.

Rather, the process is divided into modules for better
visualization.

Segmentation is a variable size partitioning scheme.

In segmentation, secondary memory and main
memory are divided into partitions of unequal size.

The size of partitions depend on the length of modules.

The partitions of secondary memory are called as
segments.

Segment Table

Segment table is a table that stores the information about
each segment of the process.

It has two columns.

First column stores the size or length of the segment.

Second column stores the base address or starting
address of the segment in the main memory.

Segment table is stored as a separate segment in the
main memory.

Segment table base register (STBR) stores the base
address of the segment table.
Segment Table

Limit indicates the length or size of the
segment.

Base indicates the base address or
starting address of the segment in the
main memory.
Fragmentation
 External Fragmentation – total memory space
exists to satisfy a request, but it is not contiguous
 Internal Fragmentation – allocated memory may
be slightly larger than requested memory; this size
difference is memory internal to a partition, but not
being used
External Fragmentation
Internal Fragmentation
Directory Structure


What is Directory?

On a computer, a directory is used to store, arrange, and
segregate files and folders.

There are several logical structures of a directory, these are
given below.

Single level directory

Two-level directory

Tree structure or hierarchical directory

Acyclic graph directory

General graph directory structure and Data Structure
Single level directory structure
Two level directory structure
Tree structured directory
Acyclic graph directory

If we want to access a file or directory from another file or
directory,the solution to this problem is presented by the
acyclic-graph directory. In this type of directory, we can
access a file or a subdirectory from multiple directories.
Hence files can be shared between directories.

It is designed in such a way that multiple directories point to
a particular directory or file with the help of links

A practical example of this is a doc file shared between
two users. If any of the users makes a change in the
file, the change is reflected for both the users.
General Graph directory

This is an extension to the acyclic-graph
directory. In the general-graph directory,
there can be a cycle inside a directory.

In the above image, we can see that a
cycle is formed in the user 2 directory.
Although it provides greater flexibility, it is
complex to implement this structure.

Thank you

You might also like