4. Suppose you have a byte-addressable virtual address memory system with 8 virtual pages of 64 bytes each, and 4 page frames. Assuming the following page table, answer the questions below: Page 0 1 2 3 5 7 Frame # Valid Bit 1 1 3 0 0 1 1 0 0 0 0 2 a) How many bits are in a virtual address? b) How many bits are in a physical address? e) What physical address corresponds to virtual addresses 0x00 and to 0x447
4. Suppose you have a byte-addressable virtual address memory system with 8 virtual pages of 64 bytes each, and 4 page frames. Assuming the following page table, answer the questions below: Page 0 1 2 3 5 7 Frame # Valid Bit 1 1 3 0 0 1 1 0 0 0 0 2 a) How many bits are in a virtual address? b) How many bits are in a physical address? e) What physical address corresponds to virtual addresses 0x00 and to 0x447
C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter10: Pointers
Section10.1: Addresses And Pointers
Problem 12E
Related questions
Topic Video
Question
![4. Suppose you have a byte-addressable virtual address memory system with 8 virtual pages of 64
bytes each, and 4 page frames. Assuming the following page table, answer the questions below:
Page
0
1
2
3
4
5
6
7
Frame # Valid Bit
1
3
0
2
1
0
0
1
1
0
0
0
a) How many bits are in a virtual address?
b) How many bits are in a physical address?
e) What physical address corresponds to virtual addresses 0x00 and to 0x44?
5. Consider a 4-drive, 200 GB-per-drive RAID array. What is the available data storage capacity
for each of the RAID levels 0, 1, 3, 4, 5, and 67
6. Consider a single-platter disk with the following parameters:
Rotation speed - 7200 rpm;
number of tracks on one side of platter - 30,000;
Number of sectors per track - 600;
Seek time-one ms for every hundred tracks traversed.
Let the disk receive a request to access a random sector on a random track and assume the
disk head starts at track 0.
a) What is the average seek time?
b) What is the average rotational latency?
e) What is the transfer time for a sector?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdcf10a49-f085-45be-9ecf-e81e9e9f2c1d%2F0cc82ca7-c227-4a21-9fda-af9f390f8ae0%2Ff07ahmr_processed.png&w=3840&q=75)
Transcribed Image Text:4. Suppose you have a byte-addressable virtual address memory system with 8 virtual pages of 64
bytes each, and 4 page frames. Assuming the following page table, answer the questions below:
Page
0
1
2
3
4
5
6
7
Frame # Valid Bit
1
3
0
2
1
0
0
1
1
0
0
0
a) How many bits are in a virtual address?
b) How many bits are in a physical address?
e) What physical address corresponds to virtual addresses 0x00 and to 0x44?
5. Consider a 4-drive, 200 GB-per-drive RAID array. What is the available data storage capacity
for each of the RAID levels 0, 1, 3, 4, 5, and 67
6. Consider a single-platter disk with the following parameters:
Rotation speed - 7200 rpm;
number of tracks on one side of platter - 30,000;
Number of sectors per track - 600;
Seek time-one ms for every hundred tracks traversed.
Let the disk receive a request to access a random sector on a random track and assume the
disk head starts at track 0.
a) What is the average seek time?
b) What is the average rotational latency?
e) What is the transfer time for a sector?
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning