Upload
madhur-gupta
View
364
Download
0
Embed Size (px)
Citation preview
ASSIGNMENT IN OPERATING SYSTEM
Segmentation And Paging
For HCTM Kaithal
Presented By : Madhur Gupta1712159CSE A 5th Sem ( 2012-2016)
Contents In The Presentation
• Memory Segmentation• Segmentation Hardware• Advantages• Disadvantages• Paging• Frames• Mapping• Combining Segmentation with Pagin
g
TYPES OF MEMORY1. Physical Memory- Total memory of the computer. EX:
RAM
2. Logical Memory- CPU memory3. Virtual memory- An imaginary memory area supported by some operating systems (for example, Windows). It is an extension of logical memory
VIRTUAL MEMORY If the size of the program
is greater than the available memory size, then the concept of virtual memory is used
Ever wondered how a 10GB Game like God Of War fits into your 2GB RAM computer?
PAGING Paging is a memory management technique in which
the memory is divided into fixed size pages. Paging is used for faster access to data. It is a logical concept
PROGRAM X
STATEMENT 1
STATEMENT 2
STATEMENT 3 STATEMENT 4 STATEMENT 5
STATEMENT 6
STATEMENT 7
Suppose a program X consists of 7 statements. But the memory can hold only 4 statements, then Paging concept is used.
PROGRAM XSTATEMENT 1STATEMENT 2STATEMENT 3STATEMENT 4STATEMENT 5STATEMENT 6STATEMENT 7
FRAMES Frames are physical concept It is present in the RAM We cannot see Pages, but we can see Frames
MAPPING Converting pages(virtual address) into frames (physical
address) Enables program to be executed It is performed by the Memory Management Unit (M.M.U.)
CPU(WHERE
PAGES ARE DIVIDED)
MMU
Memory 1Memory
2Virtual address of each page
Converts virtual address to physical address
If any error error occurs at any physical address, it is quickly retrieved from memory and sent to the CPU
EXAMPLE-LOGICAL TO PHYSICAL ADDRESS TRANSLATION IN PAGING
0 0 0 0 0 1 0 1 1 1 0 1 1 1 0
6-bit page # 10-bit offset #
16-bit logical address
0 0 0 0 1 0 11 0 0 0 1 1 0
0 0 0 1 1 0 0 1 1 1 0 1 1 1 1 0
Page Table
16-bit Physical address
LOGICAL ADDRESS AND PHYSICAL ADDRESS
LOGICAL ADDRESS
PAGE NUMBER(WHICH PAGE IS TO BE
SEARCHED IN THE MEMORY)
PAGE OFFSET(WHICH BYTE OF DATA IS TO BE READ FROM THAT
PAGE)
MAXIMUM OF 6 BYTES MAXIMUM OF 10 BYTES
PHYSICAL ADDRESS
FRAME NUMBER FRAME OFFSET
MAXIMUM OF 6 BYTES MAXIMUM OF 10 BYTES
EXAMPLELOGICAL ADDRESSPAGE P0
P1P2P3P4P5P6P7
MAPPING
PHYSICAL ADDRESS
P7P2P1P5
FO
F1F2
F3
pageframe 0
pageframe 1
pageframe 2
pageframe 3
physical memory
offsetphysical address
F3’s Value
F3
F2
F0
page table(MMU)
offsetlogical address
P=3
PAGING TRANSLATIONCPU
P0P1P2P3P4P5P6P7
F1
PAGING PROTECTIONThe paging process is protected by the
concept of insertion of an additional bit called VALID/INVALID BIT
Consider a 14 bit address space= 2^14=16383 bytes
Let us set an address limit of 10468 If five process are defined within this address
space (P0-P4), it is considered as a Valid bitProcess P5 has started before 10468, so that
alone is consideredThe remaining processes are considered as
Invalid In this way the pages are internally
fragmentedThis is how Paging is protected
• No external Fragmentation
• Simple memory management algorithm
• Swapping is easy (Equal sized Pages and Page Frames)
• Internal fragmentation
• Page tables may consume more memory.
ADVANTAGES
DISADVANTAGES
SEGMENTATION Segmentation is one of the most common ways to achieve
memory protection. Because internal fragmentation of pages takes place, the user’s
view of memory is lost The user will view the memory as a combination of segments In this type, memory addresses used are not contiguous Each memory segment is associated with a specific length and a
set of permissions. When a process tries to access the memory it is first checked to
see whether it has the required permission to access the particular memory segment and whether it is within the length specified by that particular memory segment.
1
3
2
4
1
4
2
3
user space physical memory space
LOGICAL VIEW OF SEGMENTATION
Free
Free
Segment table - maps two-dimensional user defined address into one-dimensional physical address
base - starting physical address of the segment limit - length of segment
SEGMENTATION HARDWARELogical Address space
Segment number
Offset
The maximum length of the offset value is 12 bits
Logical Address
0<d<limit
No internal fragmentation Segment tables consume
less memory than page Lends itself to sharing data
among processes. Lends itself to protection.
ADVANTAGESDISADVANTAGES
Costly memory management algorithm
As processes are loaded and removed from memory , the free memory space is broken into little pieces ,causing external fragmentation
COMBINING SEGMENTS AND PAGING
In a combined paging/segmentation system a user’s address space is broken
up into a number of segments. Each segment is broken up into a number of
fixed-sized pages which are equal in length to a main memory frame
Segmentation is visible to the programmer
Paging is transparent to the programmer
REFRENCES • www.cs.mun.ca/~
paul/cs3725/material/web/notes/node12.html• http://en.wikipedia.org/wiki/Memory_segmentation• http://www.gitam.edu/eresource/comp/gvr(os)/8.5.htm• http://www.cs.columbia.edu/~
junfeng/13fa-w4118/lectures/l05-mem.pdf• http://www.openclarity.com/node/22• http://www.cs.columbia.edu/~
junfeng/12sp-w4118/lectures/l05-mem.pdf
THANK YOU !