{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

S the virtual page number is hashed into a page table

Info iconThis preview shows pages 36–47. Sign up to view the full content.

View Full Document Right Arrow Icon
s The virtual page number is hashed into a page table. This page table contains a chain of elements hashing to the same location. s Virtual page numbers are compared in this chain searching for a match. If a match is found, the corresponding physical frame is extracted.
Background image of page 36

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Silberschatz, Galvin and Gagne 2002 9.37 Operating System Concepts Hashed Page Table
Background image of page 37
Silberschatz, Galvin and Gagne 2002 9.38 Operating System Concepts Inverted Page Table s One entry for each real page of memory. s Entry consists of the virtual address of the page stored in that real memory location, with information about the process that owns that page. s Decreases memory needed to store each page table, but increases time needed to search the table when a page reference occurs. s Use hash table to limit the search to one — or at most a few — page-table entries.
Background image of page 38

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Silberschatz, Galvin and Gagne 2002 9.39 Operating System Concepts Inverted Page Table Architecture
Background image of page 39
Silberschatz, Galvin and Gagne 2002 9.40 Operating System Concepts Shared Pages s Shared code h One copy of read-only (reentrant) code shared among processes (i.e., text editors, compilers, window systems). h Shared code must appear in same location in the logical address space of all processes. s Private code and data h Each process keeps a separate copy of the code and data. h The pages for the private code and data can appear anywhere in the logical address space.
Background image of page 40

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Silberschatz, Galvin and Gagne 2002 9.41 Operating System Concepts Shared Pages Example
Background image of page 41
Silberschatz, Galvin and Gagne 2002 9.42 Operating System Concepts Segmentation s Memory-management scheme that supports user view of memory. s A program is a collection of segments. A segment is a logical unit such as: main program, procedure, function, method, object, local variables, global variables, common block, stack, symbol table, arrays
Background image of page 42

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Silberschatz, Galvin and Gagne 2002 9.43 Operating System Concepts User’s View of a Program
Background image of page 43
Silberschatz, Galvin and Gagne 2002 9.44 Operating System Concepts Logical View of Segmentation 1 3 2 4 1 4 2 3 user space physical memory space
Background image of page 44

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Silberschatz, Galvin and Gagne 2002 9.45 Operating System Concepts Segmentation Architecture s Logical address consists of a two tuple: <segment-number, offset>, s Segment table – maps two-dimensional physical addresses; each table entry has: h base – contains the starting physical address where the segments reside in memory. h limit – specifies the length of the segment. s Segment-table base register (STBR) points to the segment table’s location in memory. s Segment-table length register (STLR) indicates number of segments used by a program; segment number s is legal if s < STLR.
Background image of page 45
Gagne 2002 9.46 Operating System Concepts Segmentation Architecture (Cont.) s Relocation. h
Background image of page 46

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 47
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page36 / 54

s The virtual page number is hashed into a page table This...

This preview shows document pages 36 - 47. Sign up to view the full document.

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online