1. Silberschatz, Galvin and Gagne  2002 9.1 Operating System Concepts Paging Logical address space of a process can be noncontiguous; process is allocated physical memory whenever the latter is available. Divide physical memory into fixed-sized blocks called frames (size is power of 2, between 512 bytes and 8192 bytes). Divide logical memory into blocks of same size called pages. Keep track of all free frames. To run a program of size n pages, need to find n free frames and load program. Set up a page table to translate logical to physical addresses. Internal fragmentation.

2. Silberschatz, Galvin and Gagne  2002 9.2 Operating System Concepts Address Translation Scheme Address generated by CPU is divided into: V(p,d) – virtual (logical) address  Page number (p) – used as an index into a page table which contains base address of each page in physical memory.  Page offset (d) – combined with base address to define the physical memory address that is sent to the memory unit.

3. Silberschatz, Galvin and Gagne  2002 9.3 Operating System Concepts Page Addressing 16 bit addresses - can address a space from 0 - (64K-1) (65536-1 = 65535) 0 to 2 16 -1 0000000000000000 to 1111111111111111 1K page size ==> (page table size 2 6 -> 64 entries) 15 1090 4K page size ==> (page table size 2 4 -> 16 entries) 15 12 110 Page # 0-63 Page # 0-15 Displacement (0 to 2 10 -1 (1023)) Displacement (0 to 2 12 -1 (4095))

4. Silberschatz, Galvin and Gagne  2002 9.4 Operating System Concepts Page Table Size Each process has its own table One entry for each possible page in process address space (dictated by address space) Examples:  16 bit address using 1K page size = (2 6 ) 64 page table entries  16 bit address using 4K page size = (2 4 ) 16 page table entries  32 bit address using 4K page size = (2 20 ) 1,028,576 (1Meg)  64 bit address using 4K page size = (2 52 ) page table entries Each page table entry might be a couple bytes!

5. Silberschatz, Galvin and Gagne  2002 9.5 Operating System Concepts Page Map Table Entry Page Frame number – physical page frame in RAM Present/absent bit –  0 indicates absent  1 indicate present Protection bits – bits indicating read/write/execute Modified (dirty bit) –  0 indicates page hasn’t been modified  1 indicates page has been changed,needs to written to SS Reference bits – bits to indicate reference info Cache disabled – caching not allowed – used for memory mapped I/O

6. Silberschatz, Galvin and Gagne  2002 9.6 Operating System Concepts Example of Address Translation V(12293)PTBRPMT Page displacement6464… 0011 0000 0000 010165… V( 3, 5) 66… + 67 pf=9=1001 + R(9,5) 1001 0000 0000 0101 16 bit address 4K page size

7. Silberschatz, Galvin and Gagne  2002 9.7 Operating System Concepts Address Translation Architecture

8. Silberschatz, Galvin and Gagne  2002 9.8 Operating System Concepts Paging Example

9. Silberschatz, Galvin and Gagne  2002 9.9 Operating System Concepts Paging Example

10. Silberschatz, Galvin and Gagne  2002 9.10 Operating System Concepts Free Frames Before allocation After allocation

11. Silberschatz, Galvin and Gagne  2002 9.11 Operating System Concepts Implementation of Page Table Page table is kept in main memory. Page-table base register (PTBR) points to the page table. Page-table length register (PTLR) indicates size of the page table. In this scheme every data/instruction access requires two memory accesses. One for the page table and one for the data/instruction. The two memory access problem can be solved by the use of a special fast-lookup hardware cache called associative memory or translation look-aside buffers (TLBs)

12. Silberschatz, Galvin and Gagne  2002 9.12 Operating System Concepts Associative Memory Associative memory – parallel search Address translation (A´, A´´)  If A´ is in associative register, get frame # out.  Otherwise get frame # from page table in memory Page #Frame #

13. Silberschatz, Galvin and Gagne  2002 9.13 Operating System Concepts Paging Hardware With TLB

14. Silberschatz, Galvin and Gagne  2002 9.14 Operating System Concepts Memory Protection Memory protection implemented by associating protection bit with each frame. Valid-invalid bit attached to each entry in the page table:  “valid” indicates that the associated page is in the process’ logical address space, and is thus a legal page.  “invalid” indicates that the page is not in the process’ logical address space.

15. Silberschatz, Galvin and Gagne  2002 9.15 Operating System Concepts Valid (v) or Invalid (i) Bit In A Page Table

16. Silberschatz, Galvin and Gagne  2002 9.16 Operating System Concepts Page Table Structure Hierarchical Paging Hashed Page Tables Inverted Page Tables

17. Silberschatz, Galvin and Gagne  2002 9.17 Operating System Concepts Hierarchical Page Tables Break up the logical address space into multiple page tables. A simple technique is a two-level page table.

18. Silberschatz, Galvin and Gagne  2002 9.18 Operating System Concepts Two-Level Paging Example A logical address (on 32-bit machine with 4K page size) is divided into:  a page number consisting of 20 bits.  a page offset consisting of 12 bits. Since the page table is paged, the page number is further divided into:  a 10-bit page number.  a 10-bit page offset. Thus, a logical address is as follows: where p i is an index into the outer page table, and p 2 is the displacement within the page of the outer page table. page number page offset pipi p2p2 d 10 12

19. Silberschatz, Galvin and Gagne  2002 9.19 Operating System Concepts Two-Level Page-Table Scheme

20. Silberschatz, Galvin and Gagne  2002 9.20 Operating System Concepts Address-Translation Scheme Address-translation scheme for a two-level 32-bit paging architecture

21. Silberschatz, Galvin and Gagne  2002 9.21 Operating System Concepts Hashed Page Tables Common in address spaces > 32 bits. The virtual page number is hashed into a page table. This page table contains a chain of elements hashing to the same location. Virtual page numbers are compared in this chain searching for a match. If a match is found, the corresponding physical frame is extracted.

22. Silberschatz, Galvin and Gagne  2002 9.22 Operating System Concepts Hashed Page Table

23. Silberschatz, Galvin and Gagne  2002 9.23 Operating System Concepts Inverted Page Table One entry for each real page of memory.  64 bit address = 2 64, using 4K page size  2 64 /2 12 = 2 52 number of page table entries  over 1 miliion gig for the PMT But… 32M of RAM (2 25 ) = 2 25 /2 12 = 8192 PMT entries Decreases memory needed to store each page table, but increases time needed to search the table when a page reference occurs. Entry consists of the virtual address of the page stored in that real memory location, with information about the process that owns that page. V(pid, vp, d)

24. Silberschatz, Galvin and Gagne  2002 9.24 Operating System Concepts Inverted Page Table Architecture

25. Silberschatz, Galvin and Gagne  2002 9.25 Operating System Concepts Shared Pages Shared code  One copy of read-only (reentrant) code shared among processes (i.e., text editors, compilers, window systems).  Shared code must appear in same location in the logical address space of all processes. Private code and data  Each process keeps a separate copy of the code and data.  The pages for the private code and data can appear anywhere in the logical address space.

26. Silberschatz, Galvin and Gagne  2002 9.26 Operating System Concepts Shared Pages Example