MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of...

12
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 3 Memory Management Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Transcript of MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of...

Page 1: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

MODERN OPERATING SYSTEMSThird Edition

ANDREW S. TANENBAUM

Chapter 3Memory Management

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 2: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

• Optimal page replacement algorithm• Not recently used page replacement• First-In, First-Out page replacement• Second chance page replacement• Clock page replacement • Least recently used page replacement• Working set page replacement• WSClock page replacement

Page Replacement Algorithms

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 3: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs at time 20 and A has its R bit set. The numbers above the pages are their load times.

Second Chance Algorithm

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 4: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-16. The clock page replacement algorithm.

The Clock Page Replacement Algorithm

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 5: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-17. LRU using a matrix when pages are referenced in the order 0, 1, 2, 3, 2, 1, 0, 3, 2, 3.

LRU Page Replacement Algorithm

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 6: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-18. The aging algorithm simulates LRU in software. Shown are six pages for five clock ticks. The five clock ticks

are represented by (a) to (e).

Simulating LRU in Software

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 7: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-19. The working set is the set of pages used by the k most recent memory references. The function w(k, t) is the

size of the working set at time t.

Working Set Page Replacement (1)

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 8: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-20. The working set algorithm.

Working Set Page Replacement (2)

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 9: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

When the hand comes all the way around to its

starting point there are two cases to consider:

• At least one write has been scheduled.

• No writes have been scheduled.

The WSClock Page Replacement Algorithm (1)

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 10: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-21. Operation of the WSClock algorithm. (a) and (b) give an example of what happens when R = 1.

The WSClock Page Replacement Algorithm (2)

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 11: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-21. Operation of the WSClock algorithm. (c) and (d) give an example of R = 0.

The WSClock Page Replacement Algorithm (3)

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

Page 12: MODERN OPERATING SYSTEMS - Fordhamagw/os/slides/pdf/tanenbaum.pdf · Figure 3-15. Operation of second chance. (a) Pages sorted in FIFO order. (b) Page list if a page fault occurs

Figure 3-22. Page replacement algorithms discussed in the text.

Summary of Page Replacement Algorithms

Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639


Elastic Fifo

Elastic Fifo

Modeling FIFO Communication Channels Using SystemVerilog ... · PDF fileSNUG Boston 2004 1 Modeling FIFO Channels Using SystemVerilog Interfaces Modeling FIFO Communication Channels

Modeling FIFO Communication Channels Using SystemVerilog ... · PDF fileSNUG Boston 2004 1 Modeling FIFO Channels Using SystemVerilog Interfaces Modeling FIFO Communication Channels

Fifo Method

Fifo Method

FPGA ta ‑FIFO‑ ‑ IOT architectur...FIFO Memory FIFO wptr &f ull FIFO rptr &e mpty Unsync. full/empty detector M U X writeclk wrst sync_r2w wptr wq2_rptr unsynchronized_full full

FPGA ta ‑FIFO‑ ‑ IOT architectur...FIFO Memory FIFO wptr &f ull FIFO rptr &e mpty Unsync. full/empty detector M U X writeclk wrst sync_r2w wptr wq2_rptr unsynchronized_full full

UART with FIFO Buffer - Altera with FIFO Buffer Walkthrough ... The universal asynchronous receiver transmitter module (UART) with first-in first-out (FIFO) ...

UART with FIFO Buffer - Altera with FIFO Buffer Walkthrough ... The universal asynchronous receiver transmitter module (UART) with first-in first-out (FIFO) ...

Fifo Buffers

Fifo Buffers

ASync FIFO

ASync FIFO

Asynchronous FIFO v6.1

Asynchronous FIFO v6.1

Asynchronous FIFO

Asynchronous FIFO

FIFO Basics (USB2.0)

FIFO Basics (USB2.0)

FIFO USER GUIDE.pdf

FIFO USER GUIDE.pdf

FUJITSU SEMICONDUCTOR · 1.3 05. Oct. 2001 AC Spec for both devices, Lavender added/Jasmine reviewed Two pinning lists - sorted by name/pin number ULB DMA limit description (DMA FIFO

FUJITSU SEMICONDUCTOR · 1.3 05. Oct. 2001 AC Spec for both devices, Lavender added/Jasmine reviewed Two pinning lists - sorted by name/pin number ULB DMA limit description (DMA FIFO

AHB interface FIFO - capital-micro. · PDF file3 AHB interface FIFO IP Usage ... asynchronous FIFO and synchronous FIFO The interface type of Write port and Read port can be configured

AHB interface FIFO - capital-micro. · PDF file3 AHB interface FIFO IP Usage ... asynchronous FIFO and synchronous FIFO The interface type of Write port and Read port can be configured

Ug Uart Fifo

Ug Uart Fifo

Fifo Period

Fifo Period

Design of Synchronous Fifo

Design of Synchronous Fifo

Altera FPGA FIFO master Programming Guide - FTDI Altera FPGA … · GuideAN_377 Altera FPGA FIFO master Programming ... Document Title: AN_377 Altera FPGA FIFO master Programming

Altera FPGA FIFO master Programming Guide - FTDI Altera FPGA … · GuideAN_377 Altera FPGA FIFO master Programming ... Document Title: AN_377 Altera FPGA FIFO master Programming

Asynchronous FIFO Design

Asynchronous FIFO Design

BMI08x FIFO Usage - Bosch Global...defined level. FIFO-full interrupt: Triggered, when the FIFO is full. 3. Accelerometer sensor FIFO buffer The accelerometer part of BMI088 has an

BMI08x FIFO Usage - Bosch Global...defined level. FIFO-full interrupt: Triggered, when the FIFO is full. 3. Accelerometer sensor FIFO buffer The accelerometer part of BMI088 has an

Perpetual fifo

Perpetual fifo