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, 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 page 0. (In other words, what page numbers are referenced. Convert address to a page number). b) For the page sequence derived in part (a), determine the number of page faults for each of the following page replacement strategies, assuming that 2 page frames are available to the program. (Assume no TLB) 1) LRU 2) FIFO 3) 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
icon
Related questions
Question

PLEASE HELP WITH PARTS A AND B FOR THIS QUESTIONS! If possible also provide explanations/instructions on how to solve it!! 

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, 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 page 0. (In other words, what page numbers are referenced.
Convert address to a page number).
b) For the page sequence derived in part (a), determine the number of page faults for
each of the following page replacement strategies, assuming that 2 page frames are
available to the program. (Assume no TLB)
1) LRU
2) FIFO
3) OPT (Optimal)
Transcribed Image Text: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, 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 page 0. (In other words, what page numbers are referenced. Convert address to a page number). b) For the page sequence derived in part (a), determine the number of page faults for each of the following page replacement strategies, assuming that 2 page frames are available to the program. (Assume no TLB) 1) LRU 2) FIFO 3) OPT (Optimal)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education