8
Most read
10
Most read
11
Most read
Storage Management

•   Paged Segmentation




                                     1
HOME     PREVIOUS TOPIC NEXT
PREVIOUS QUESTION PAPERS FOR OS
CPP TUTORIALS




                                  2
Recap…

In the last class, you have learnt:

Paging concepts and segmentation
    Pages

    Frames

    Segments




                                      3
Objective


  On completion of this period, you would be able
  to know
• Paged Segmentation




                                                    4
Segmentation with Paging – MULTICS

• The MULTICS system solved problems of

  external fragmentation and lengthy search times

  by paging the segments

• Paging eliminates external fragmentation

• Segment-table entry contains the base address

  of a page table for that segment              5
Segmentation with Paging – MULTICS
• In MULTICS logical address = 18-bit segment no. +
  16-bit offset
• This scheme creates a 34-bit address space
• Each page in MULTICS consists of 1 K words
• So the segment offset is broken in to 6-bit page no. and
  10-bit page offset
• Page no. indexes into the page table to give the frame
  no.
• Frame no. is combined with the page offset to form a
  physical address
                                                             6
Segmentation with Paging – MULTICS

• Must have a separate page table for each segment

• The 18-bit segment no. could have up to 2,62,144

  segments

• So the 18-bit segment no. is broken into 8-bit page no.

  and 10-bit page offset

• The segment table is represented by a page table

  consisting of up to 28 entries
                                                            7
Segmentation with Paging – MULTICS

• The logical address in MULTICS is as follows


          Segment number                  Offset

         S1          S2           d1               d2

          8          10               6            10

                           Figure:1



                                                        8
Segmentation with Paging – MULTICS

• In fig1 s1 index into the page table of the segment table

• s2 is the displacement within the page of the segment

  table

• d1 is a displacement in to the page table of the desired

  segment

• d2 is the displacement into the page containing the word

  to be accessed
                                                              9
Segmentation with Paging – MULTICS
      Logical address
S1        S2   d1         d2


     s1

                    s2

       Page table                  d1
      for segment                                   d1
          table          Page of
                         segment
                           table          Page
                                        table for
                                                          Page of
                                        segment
                                                         segment



                                                                    10
MULTICS Address Translation Scheme




                                     11
Segmentation with Paging – Intel 386

• As shown in the following slide, the Intel 386 uses

  segmentation with paging for memory management with

  a two-level paging scheme




                                                        12
Internal architecture of paged segmentation

   Paged Segmentation
Combination of paging and
segmentation address =
   frame at (page table base
for segment)
   + offset into page table
   + offset into memory
Look at example of Intel
architecture
                                             13
Summary

In this class, you have learnt

• Paged Segmentation




                                 14
Frequently Asked Questions

• What is Paged Segmentation?

• Explain the Paged segmentation hardware with

  a neat diagram ?




                                                 15
Quiz
1. Page no. indexes into the page table to give
  the
  a) Segmentation
  b) Frame no.
  C) None

2. MULTICS must have a separate page table for
  each
  a) Page offset
  b) Hole
 c) segment
 d) None
                                                  16
Quiz

3. ____________ scheme creates a 34-bit address
  space

a) Page number

b) MULTICS

c) Compaction

d) None


                                            17
Quiz
4. The _________system solved problems of
  external fragmentation
a) External fragmentation
b) MULTICS
c) Compaction
d) None




                                            18
Other subject materials

•   Web designing
•   Micro processors
•   C++ tutorials
•   java

home

More Related Content

PPTX
Three address code In Compiler Design
PPT
Intermediate code generation (Compiler Design)
PPTX
Instruction cycle with interrupts
PPTX
Cohen sutherland line clipping
PPT
Compiler Construction introduction
PPTX
Fundamentals of Language Processing
PDF
Unit 3
PDF
Syntax analysis
Three address code In Compiler Design
Intermediate code generation (Compiler Design)
Instruction cycle with interrupts
Cohen sutherland line clipping
Compiler Construction introduction
Fundamentals of Language Processing
Unit 3
Syntax analysis

What's hot (20)

PPT
Computer architecture pipelining
PPTX
Assemblers
PDF
Intermediate code generation in Compiler Design
PPTX
Distributed shred memory architecture
PPTX
Paging and Segmentation in Operating System
PPT
Ll(1) Parser in Compilers
PPT
Parallel processing
PDF
Code generation in Compiler Design
PDF
Token, Pattern and Lexeme
PPT
Unit 3-pipelining & vector processing
PPTX
Polygon filling algorithm
PPT
finding Min and max element from given array using divide & conquer
PPT
Introduction to Compiler Construction
PPT
Introduction to data structures and Algorithm
PPTX
Specification-of-tokens
PPTX
Code generation
PPTX
Ch 4 linker loader
PPTX
Computer architecture page replacement algorithms
PPT
Disk scheduling
Computer architecture pipelining
Assemblers
Intermediate code generation in Compiler Design
Distributed shred memory architecture
Paging and Segmentation in Operating System
Ll(1) Parser in Compilers
Parallel processing
Code generation in Compiler Design
Token, Pattern and Lexeme
Unit 3-pipelining & vector processing
Polygon filling algorithm
finding Min and max element from given array using divide & conquer
Introduction to Compiler Construction
Introduction to data structures and Algorithm
Specification-of-tokens
Code generation
Ch 4 linker loader
Computer architecture page replacement algorithms
Disk scheduling
Ad

Viewers also liked (20)

PPTX
File management53(1)
PPT
35. multiplepartitionallocation
PPT
36 fragmentaio nnd pageconcepts
PPT
40 demand paging
PPT
Thrashing allocation frames.43
PPT
39 virtual memory
PPT
37 segmentation
PPTX
Paging and segmentation
PPT
Types of memory 10 to11
PPT
Types of memory
PPTX
Hibernate example1
PPT
Data type
PPT
Fundamentals
PPT
Deleting structure.56
PPT
Set model and page fault.44
PPT
Files concepts.53
PPTX
File directory definition 54(2)
PPTX
Operations on a directory 54(3
PPT
Disk scheduling.49
PPT
File management53(1)
35. multiplepartitionallocation
36 fragmentaio nnd pageconcepts
40 demand paging
Thrashing allocation frames.43
39 virtual memory
37 segmentation
Paging and segmentation
Types of memory 10 to11
Types of memory
Hibernate example1
Data type
Fundamentals
Deleting structure.56
Set model and page fault.44
Files concepts.53
File directory definition 54(2)
Operations on a directory 54(3
Disk scheduling.49
Ad

Similar to 38 paged segmentation (20)

PPTX
Combined paging and segmentation
PDF
Memory Management Strategies - III.pdf
PPTX
Paging & segmentation; advantages and disadvantage
DOCX
PAGIN AND SEGMENTATION.docx
PPTX
Memory management
PPTX
Structure of the page table
PDF
[2D3]TurboGraph- Ultrafast graph analystics engine for billion-scale graphs i...
PDF
Webinar: Tailored Big Data Solutions using MapReduce Design Patterns
PPTX
STRUCTURE OF PAGE TABLE IN OPERATING SYSTEM
PPTX
OS-02 Segmentation.pptx
PPTX
Hpverticacertificationguide 150322232921-conversion-gate01
PPTX
Hp vertica certification guide
PDF
Things you should know about Oracle truncate
PDF
Graph chi
PDF
HP - Jerome Rolia - Hadoop World 2010
PPT
Csc4320 chapter 8 2
PPT
Segmentation geekssay.com
Combined paging and segmentation
Memory Management Strategies - III.pdf
Paging & segmentation; advantages and disadvantage
PAGIN AND SEGMENTATION.docx
Memory management
Structure of the page table
[2D3]TurboGraph- Ultrafast graph analystics engine for billion-scale graphs i...
Webinar: Tailored Big Data Solutions using MapReduce Design Patterns
STRUCTURE OF PAGE TABLE IN OPERATING SYSTEM
OS-02 Segmentation.pptx
Hpverticacertificationguide 150322232921-conversion-gate01
Hp vertica certification guide
Things you should know about Oracle truncate
Graph chi
HP - Jerome Rolia - Hadoop World 2010
Csc4320 chapter 8 2
Segmentation geekssay.com

More from myrajendra (20)

PPTX
Jdbc workflow
PPTX
2 jdbc drivers
PPTX
3 jdbc api
PPTX
4 jdbc step1
PPTX
Dao example
PPTX
Sessionex1
PPTX
Internal
PPTX
3. elements
PPTX
2. attributes
PPTX
1 introduction to html
PPTX
Headings
PPTX
Forms
PPT
PPTX
Views
PPTX
Views
PPTX
Views
PPT
Starting jdbc
PPTX
Properties
PPTX
Java.sql package
PPTX
Interface callable statement
Jdbc workflow
2 jdbc drivers
3 jdbc api
4 jdbc step1
Dao example
Sessionex1
Internal
3. elements
2. attributes
1 introduction to html
Headings
Forms
Views
Views
Views
Starting jdbc
Properties
Java.sql package
Interface callable statement

38 paged segmentation

  • 1. Storage Management • Paged Segmentation 1
  • 2. HOME PREVIOUS TOPIC NEXT PREVIOUS QUESTION PAPERS FOR OS CPP TUTORIALS 2
  • 3. Recap… In the last class, you have learnt: Paging concepts and segmentation  Pages  Frames  Segments 3
  • 4. Objective On completion of this period, you would be able to know • Paged Segmentation 4
  • 5. Segmentation with Paging – MULTICS • The MULTICS system solved problems of external fragmentation and lengthy search times by paging the segments • Paging eliminates external fragmentation • Segment-table entry contains the base address of a page table for that segment 5
  • 6. Segmentation with Paging – MULTICS • In MULTICS logical address = 18-bit segment no. + 16-bit offset • This scheme creates a 34-bit address space • Each page in MULTICS consists of 1 K words • So the segment offset is broken in to 6-bit page no. and 10-bit page offset • Page no. indexes into the page table to give the frame no. • Frame no. is combined with the page offset to form a physical address 6
  • 7. Segmentation with Paging – MULTICS • Must have a separate page table for each segment • The 18-bit segment no. could have up to 2,62,144 segments • So the 18-bit segment no. is broken into 8-bit page no. and 10-bit page offset • The segment table is represented by a page table consisting of up to 28 entries 7
  • 8. Segmentation with Paging – MULTICS • The logical address in MULTICS is as follows Segment number Offset S1 S2 d1 d2 8 10 6 10 Figure:1 8
  • 9. Segmentation with Paging – MULTICS • In fig1 s1 index into the page table of the segment table • s2 is the displacement within the page of the segment table • d1 is a displacement in to the page table of the desired segment • d2 is the displacement into the page containing the word to be accessed 9
  • 10. Segmentation with Paging – MULTICS Logical address S1 S2 d1 d2 s1 s2 Page table d1 for segment d1 table Page of segment table Page table for Page of segment segment 10
  • 12. Segmentation with Paging – Intel 386 • As shown in the following slide, the Intel 386 uses segmentation with paging for memory management with a two-level paging scheme 12
  • 13. Internal architecture of paged segmentation Paged Segmentation Combination of paging and segmentation address = frame at (page table base for segment) + offset into page table + offset into memory Look at example of Intel architecture 13
  • 14. Summary In this class, you have learnt • Paged Segmentation 14
  • 15. Frequently Asked Questions • What is Paged Segmentation? • Explain the Paged segmentation hardware with a neat diagram ? 15
  • 16. Quiz 1. Page no. indexes into the page table to give the a) Segmentation b) Frame no. C) None 2. MULTICS must have a separate page table for each a) Page offset b) Hole c) segment d) None 16
  • 17. Quiz 3. ____________ scheme creates a 34-bit address space a) Page number b) MULTICS c) Compaction d) None 17
  • 18. Quiz 4. The _________system solved problems of external fragmentation a) External fragmentation b) MULTICS c) Compaction d) None 18
  • 19. Other subject materials • Web designing • Micro processors • C++ tutorials • java home