Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Please help me with this Operating Systems Principles homework:   I need help with question 2. Q2

Please help me with this Operating Systems Principles homework:   I need help with question 2. Q2

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

Please help me with this Operating Systems Principles homework:

 

I need help with question 2. Q2

Q1. Which of the six resource-allocation graphs below illustrate deadlock? For those situations that are deadlocked, provide the cycle of threads and resources. Where there is not a deadlock situation, illustrate the order in which the threads may complete execution. (a) (d) Q2. R₁ : T₁ R₁₂ T₂ R₂ .. T3 PO 22228 P1 P2 Consider the following snapshot of a system: Allocation A B C D 1202 0 1 1 2 1240 1 201 1 0 0 1 P3 (b) P4 (e) T₁ R₁ 53 R₂ T₂ a. How many bits are there in the logical address? b. How many bits are there in the physical address? T4 T3 R3 (f) Max A B C D 4 3 16 24 24 3651 2623 3 1 1 2 R₂₁ R₁ 13 R₂ T4 R₂ 13 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the threads may complete. Otherwise, illustrate why the state is unsafe. a. Available = (2, 2, 2, 3) b. Available = (4, 4, 1, 1) c. Available = (3, 0, 1, 4) d. Available = (1, 5, 2, 2) Q3. Consider a logical address space of 4,048 pages with a 2 KB page size, mapped onto a physical memory of 1024 frames. Answer and explain the following. Q4. Consider a paging system with the page table stored in memory. Answer and explain the following. a. If a memory reference takes 75 nanoseconds, how long does a paged memory reference take? b. If we add TLBs, and if 80 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry in the TLBs takes 4 ns)
Transcribed Image Text:Q1. Which of the six resource-allocation graphs below illustrate deadlock? For those situations that are deadlocked, provide the cycle of threads and resources. Where there is not a deadlock situation, illustrate the order in which the threads may complete execution. (a) (d) Q2. R₁ : T₁ R₁₂ T₂ R₂ .. T3 PO 22228 P1 P2 Consider the following snapshot of a system: Allocation A B C D 1202 0 1 1 2 1240 1 201 1 0 0 1 P3 (b) P4 (e) T₁ R₁ 53 R₂ T₂ a. How many bits are there in the logical address? b. How many bits are there in the physical address? T4 T3 R3 (f) Max A B C D 4 3 16 24 24 3651 2623 3 1 1 2 R₂₁ R₁ 13 R₂ T4 R₂ 13 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the threads may complete. Otherwise, illustrate why the state is unsafe. a. Available = (2, 2, 2, 3) b. Available = (4, 4, 1, 1) c. Available = (3, 0, 1, 4) d. Available = (1, 5, 2, 2) Q3. Consider a logical address space of 4,048 pages with a 2 KB page size, mapped onto a physical memory of 1024 frames. Answer and explain the following. Q4. Consider a paging system with the page table stored in memory. Answer and explain the following. a. If a memory reference takes 75 nanoseconds, how long does a paged memory reference take? b. If we add TLBs, and if 80 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry in the TLBs takes 4 ns)
Expert Solution
steps

Step by step

Solved in 7 steps with 9 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of System Design
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
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
SEE MORE TEXTBOOKS