Consider the following sequence of virtual memory references (in decimal) generated by a single program in a pure paging system: 100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640 a. Derive the corresponding reference string of pages (i.e. the pages the virtual addresses are located on), assuming a page size of 1024 bytes. (Assume that page numbering starts at 0) b. For the page sequence derived above, determine the number of page faults for each of the following page replacement strategies, assuming that two (2) page frames are available to the program. i. LRU ii. FIFO iii. OPT (Optimal)
Consider the following sequence of virtual memory references (in decimal) generated by a single program in a pure paging system: 100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640 a. Derive the corresponding reference string of pages (i.e. the pages the virtual addresses are located on), assuming a page size of 1024 bytes. (Assume that page numbering starts at 0) b. For the page sequence derived above, determine the number of page faults for each of the following page replacement strategies, assuming that two (2) page frames are available to the program. i. LRU ii. FIFO iii. OPT (Optimal)
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Topic Video
Question
) Consider the following sequence of virtual memory references (in decimal) generated
by a single program in a pure paging system:
100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640
a. Derive the corresponding reference string of pages (i.e. the pages the virtual addresses
are located on), assuming a page size of 1024 bytes. (Assume that page numbering
starts at 0)
b. For the page sequence derived above, determine the number of page faults for each of
the following page replacement strategies, assuming that two (2) page frames are
available to the program.
i. LRU
ii. FIFO
iii. OPT (Optimal)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education