A paged memory is shared by two processes, p1 and p2. 16 24 15 1 3 -2 9 -3 17 -12 25 -3 18 -16 19 10 8 26 27 2 3 11 12 4 -45 12 20 21 22 23 28 Page table 13-12 Page table 29 1 8 6 28 of p1 7 14 24 of p2 15 30 31 -2 • The size of each page and page table is 4. • The page table of p1 begins at address 4. The page table of p2 begins at address 12. • A dash denotes a nonexistent page. • The sign bit serves as the present bit. Thus a positive number in a page table is the address of a resident page and a negative number denotes a non-resident page. Both processes reference the virtual addresses: 0, 1, 4, 5, 8, 10, 12, 15. Fill in the missing entries in the following table. In the "Access by p1" and "Access by p2" columns, enter one of the following: • If the address being referenced is in memory, enter the value found in the associated memory location. • If the memory reference will cause a page fault, enter "Page fault" • If the memory reference is illegal, enter "Error"
A paged memory is shared by two processes, p1 and p2. 16 24 15 1 3 -2 9 -3 17 -12 25 -3 18 -16 19 10 8 26 27 2 3 11 12 4 -45 12 20 21 22 23 28 Page table 13-12 Page table 29 1 8 6 28 of p1 7 14 24 of p2 15 30 31 -2 • The size of each page and page table is 4. • The page table of p1 begins at address 4. The page table of p2 begins at address 12. • A dash denotes a nonexistent page. • The sign bit serves as the present bit. Thus a positive number in a page table is the address of a resident page and a negative number denotes a non-resident page. Both processes reference the virtual addresses: 0, 1, 4, 5, 8, 10, 12, 15. Fill in the missing entries in the following table. In the "Access by p1" and "Access by p2" columns, enter one of the following: • If the address being referenced is in memory, enter the value found in the associated memory location. • If the memory reference will cause a page fault, enter "Page fault" • If the memory reference is illegal, enter "Error"
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:A paged memory is shared by two processes, p1 and p2.
8
24
25
-3
16
17-12
18-16
19
15
9
-3
1
3
10
8
26
-3
27
2
-2
11 12
4-45
8 Page table
6 28 of p1
12
20
28
29
30
13 -12 |Page table
21
22
1
24 of p2
2
14
7
-2
15
23
31
3
• The size of each page and page table is 4.
The page table of p1 begins at address 4. The page table of p2 begins at address 12.
· A dash denotes a nonexistent page.
The sign bit serves as the present bit. Thus a positive number in a page table is the address of a resident page and a
negative number denotes a non-resident page.
Both processes reference the virtual addresses: 0, 1,4, 5, 8, 10, 12, 15.
Fill in the missing entries in the following table. In the "Access by p1" and "Access by p2" columns, enter one of the following:
• If the address being referenced is in memory, enter the value found in the associated memory location.
• If the memory reference will cause a page fault, enter "Page fault"
• If the memory reference is illegal, enter "Error"
Virtual Address
Page Number (p)
Offset (w)
Access by p1
Access by p2
Blank 1
Blank 2
Blank 3
Blank 4
1
Blank 5
Blank 6
Blank 7
Blank 8
Blank 9
Blank 10
Blank 11
Blank 12
Blank 13
Blank 14
Blank 15
Blank 16
8
Blank 17
Blank 18
Blank 19
Blank 20
10
Blank 21
Blank 22
Blank 23
Blank 24
12
Blank 25
Blank 26
Blank 27
Blank 28
15
Blank 29
Blank 30
Blank 31
Blank 32
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 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY