Assignment No. 03
CS604 –Operating System
Total Marks: 20
Due Date: 28-07-2016
Rules for Marking:
It should be clear that your assignment will not get any credit if:
Prepare 4 to 5 slides and record your video about the following topic. Upload slides and video on VU-LMS after zipping it.
Topic: How Paging Saves External Fragmentation
Instructions for the assignment preparation:
Weightage of Assignment:
Instructions for the assignment submission:
For any query about the assignment, contact at firstname.lastname@example.org
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)
4 slides ki vido separet separate 4 bnani ha .jb aek slide open ho to ek videi ai aur jab dasri file open ho to dosri video
4 slide bnani he aur video srf ek hi bnani ha js me wohi btana ha jo kuch in slides me ha
TOPIC BHT EASY HA G.
TOPIC YE HA ASAN ALFAZ MN K KIS TARHAN PAGING MN EXTERNAL FRAGMENTATION KI ZARORAT NAI REHTI? SO SIMPLE
Ali ap topic ghalt bta rhy ho shayad .....
How Paging Saves External Fragmentation
mean paging external fragmentention ma kitni useful ha or paging external fragmentation ko kesy save krti ha ...i think asy topic ha
jnb paging mn tu external fragmention use he nai hoti? useful kaisy ho ge?
is men audio recording b send kar sakty hai zarori nhe ky video recording do
video with proper dress code means proper dreees up ho k video bnanai ha
for help click here
4 slides n one video ?
Paging is to deal with external fragmentation problem. This is to allow the logical address space of a process to be noncontiguous, which makes the process to be allocated physical memory
In the memory management techniques discussed so far, two Paging is a memory
management scheme that permits the physical address space of a process to be noncontiguous.
It avoids the considerable problem of fitting the various sized memory
chunks onto the backing store, from which most of the previous memory-management
schemes suffered. When some code fragments or data residing in main memory need to
be swapped out, space must be found on the backing store. The fragmentation problems
discussed in connection with main memory are also prevalent with backing store, except
that access is much slower so compaction is impossible.
Physical memory is broken down into fixed-sized blocks, called frames, and logical
memory is divided into blocks of the same size, called pages. The size of a page is a
power of 2, the typical page table size lying between 1K and 16K. It is important to keep
track of all free frames. In order to run a program of size n pages, we find n free frames
and load program pages into these frames. In order to keep track of a program’s pages in
the main memory a page table is used.
Thus when a process is to be executed, its pages are loaded into any available
memory frames from the backing store. The following snapshots show process address
space with pages (i.e., logical address space), physical address space with frames, loading
of paging into frames, and storing mapping of pages into frames in a page table.
Paging itself is a form of dynamic relocation. When we use a paging scheme, we have
no external fragmentation; however we may have internal fragmentation. An important
aspect of paging is the clear separation between the user’s view of memory and the actual
physical memory. The user views that memory as one single contiguous space,
containing only this program. In fact, the user program is scattered throughout the
physical memory, which also holds other programs.
• Page size = 4 bytes
• Process address space = 4 pages
• Physical address space = 8 frames
• Logical address: (1,3) = 0111
• Physical address: (6,3) = 1011
Yar carefully listen to this and very easy assignment ha https://youtu.be/4_qdrTpze14?list=PLC7EBD346D045E2B1
koi solution dy do